igraph 0.5.1 Release Notes
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 the news page for the complete list of changes.
The DrL layout generator was added
This is a sophisticated and efficient layout generator written by Shawn Martin and colleagues. See more in the R manual, in the Python documentation or in the C library reference manual.
Uniform sampling of random graphs with given degree sequence
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 R manual, in the Python documentation or in the C library reference manual.
Conversions
igraph includes some functions to convert graphs to and from
graphNEL objects as defined in the graph package
(igraph.to.graphNEL,
igraph.from.graphNEL) and
sparse matrices using the Matrix package
(get.adjacency,
graph.adjacency,
see the sparse argument).
New graph constructors
A new function was added to create graphs from adjacency lists
(graph.adjlist),
and graph.data.frame
has an argument call vertices, this allows easy
construction of graphs with vertex and edge meta data.
Weighted shortest path algorithms
Both the Dijkstra and the Belmann-Ford algorithms were added. See more in the R documentation, the Python manual or in the C library reference manual.
Function to test edge reciprocity
Mutuality can be tested for each edge now. See more in the R documentation, in the Python manual, or in the C reference manual.
Vertex shapes
The R interface now supports different vertex shapes when plotting. See more in the R documentation.