About igraph releases and other things
igraph 0.5.1 is a bugfix release, but it actually contains many important new things as well. Here is a brief summary about each of them. See below for the complete list of changes.
This is a sophisticated and efficient layout generator written by Shawn Martin and colleagues. See more in the manual.
A nice random graph generator that conditions on the degree of vertices was added. It can generate undirected connected graphs. The algorithm and the implementation was done by Fabien Viger and Matthieu Latapy. See more in the manual.
igraph includes some functions to convert graphs to and from
graphNEL objects as defined in the graph package
sparse matrices using the Matrix package
A new function was added to create graphs from adjacency lists
has an argument call
vertices, this allows easy
construction of graphs with vertex and edge meta data.
Both the Dijkstra and the Belmann-Ford algorithms were added. See more in the documentation.
Mutuality can be tested for each edge now. See more in the documentation.
The R interface now supports different vertex shapes when plotting. See more in the R documentation.
graph.adjlistcreates igraph graphs from adjacency lists.
arrow.widthgraphical parameter was added.
graph.data.framehas a new argument
get.adjacencysupport sparse matrices, the
Matrixpackage is required to use this functionality.
graph.adjacencyadds column/row names as
Inffor unreachable vertices.
is.mutualto find mutual edges in a directed graph.
asymmetric.preference.gamewere rewritten, they are O(|V|+|E|) now, instead of O(|V|^2).
get.shortest.paths, it uses Dijkstra’s algorithm.
igraph_random_sample), now it always generates unique numbers. This affects the G(n,m) Erdos-Renyi generator, it always generates simple graphs now.
igraph_empty_attrs, all functions are expected to call this internally) now checks whether the number of vertices is finite.