About igraph releases and other things
July 14, 2008
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 Python documentation.
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 Python documentation.
Both the Dijkstra and the Belmann-Ford algorithms were added. See more in the Python manual.
Mutuality can be tested for each edge now. See more in the Python manual.
igraph.ALLconstants now also accept these as strings (
"all"). Prefix matches also allowed as long as the prefix match is unique.
Graph.shortest_paths()now supports edge weights (Dijkstra's and Bellman-Ford algorithm implemented)
Graph.get_shortest_paths()also supports edge weights (only Dijkstra's algorithm yet)
Graph.is_mutual()to find mutual edges in a directed graph.
asymmetric.preference.gamewere rewritten, they are O(|V|+|E|) now, instead of O(|V|^2).
Layout.to_radial()added -- now you can create a top-down tree layout by the Reingold-Tilford algorithm and then turn it to a radial tree layout
Graph.write_pajek()to save graphs in Pajek format
EdgeSeq, restricted to the current vertex/edge sequence of course
Graph.Weighted_Adjacency()to create graphs from weighted adjacency matrices
Graph.Asymmetric_Preference()were rewritten, they are O(|V|+|E|) now, instead of O(|V|^2).
Graph.constraint()now properly returns floats instead of integers (thanks to Eytan Bakshy)
Graph.Preference()now accepts floats in type distributions
EdgeSeqobjects can now be subsetted by lists and tuples as well
Graph.authority_score()now really returns the authority scores instead of the hub scores (blame copypasting)
igraph_random_sample), now it always generates unique numbers. This affects the G(n,m) Erdos-Renyi generator, it always generates simple graphs now.