About igraph releases and other things
There are a lot of improvements and corrections in this version. We would like to thank all the people who sent comments, bug reports, patches, or just questions. Without their contribution igraph would be definitely much less and worse than it is now. Please keep sending your comments and ideas!
Here is a list of major changes, with links to the relevant sections of the documentation. See below for the complete list of changes.
igraph includes the BLISS graph isomorphism algorithm and implementation now. This and the improved VF2 implementation, which can now calculate subgraph isomorphism, make igraph support the bleeding edge of graph isomorphism algorithms. Many thanks to the authors of BLISS. See the details in the Reference Manual, in the R documentation or in the Python documentation.
ARPACK is a library for solving large scale sparse eigenvalue problems. In igraph it is very handy, as many centrality problems are in fact eigenvalue problems: Kleinberg’s hub and authority scores, PageRank, the leading eigenvector community detection algorithm are some examples. Many thanks to the authors of ARPACK and James Fowler, who suggested to include it in igraph.
See the details in the documentation.
Some classic graphs can be created by giving their name. This is
very handy if one needs a test graph quickly. See
(The idea is based on Combinatorica, a Mathematica extension.)
function provides a simple, concise way to create (small) graphs.
Numerous examples are included in the
Many functions were updated to handle weighted graphs: fast greedy
Page Rank (
modularity calculation (modularity),
the Fruchterman-Reingold layout algorithm
Some functions were added and improved to handle non-simple graphs
(i.e. graphs with loop and/or multiple edges) better: testing that a
graph is simple (
testing for loop edges
testing for multiple edges
and counting the multiplicity of edges
This is a nice force-based layout algorithm. See the documentation for details.
igraph can now write graphs to files in the DOT format, used by GraphViz. See the documentation.
Classic social network analysis tools for classifying the dyads
dyad.census) and triads
igraph is now able to calculate
biconnected components and
There were some minor improvements in R graphics. New graphical
shape for different vertex shapes, right now only
circles and squares are supported.
plot.igraph has as
add) to plot many graphs on the same plot,
maybe on top of each other. It also supports the
sub arguments now. See more here.
In previous versions of the igraph R package the allocated memory was not freed if the computation was interrupted. This surely affected MS Windows platforms, maybe also OSX. (Not Linux.) igraph 0.5 correctly deallocates all memory on all platforms after an interruption.
These measures can be quickly estimated by specifying an upper bound for path lengths to be considered. This is useful for larger graphs, for which the calculation takes a long time. See documentation for closeness, betweenness, and edge betweenness.
Two vertex similarity measures based on the number of common neighbors are introduced, the Jaccard and Dice similarities. See the manual for details.
Up to now igraph warnings were dumped to the console when using the igraph R package. In many cases this meant that they were effectively lost. In the new version igraph warnings are converted to proper R warnings.
framegraphical parameters were added
addargument now to compose plots with multiple graphs
layout.normis public now, it can normalize a layout
CTRL+C/ESC ispressed, in all operating systems
plot.igraphcan plot square vertices now, see the
graph.adjacencyrewritten when creating weighted graphs
match.arg whenever possible. This means that character scalar
options can be abbreviated and they are always case insensitive
evcent. New functions based on ARPACK:
as.undirectedhandles attributes now
grg.game) can return the coordinates of the vertices
read.graphcan handle all possible line terminators now (\r, \n, \r\n, \n\r)
cohesive.blocks, cohesive blocks were sometimes not calculated correctly