About igraph releases and other things
The version number is not a mistake, we jump to 0.6.5 from 0.6, for technical reasons.
igraph 0.6.5 is a minor release that contains only few big changes, and fixes a number of very annoying bugs.
See at the end for the complete list of changes. First let’s see the most important new features and changes.
static method in Python now allows easy conversion of lists of tuples (such as
database records or contents of CSV files) into graphs with named vertices and
See more in the documentation.
We added some new functions if a sequence of integers is graphial, i.e. it can be the degree sequence of a simple graph. See more in the documentation.
It is possible now to generate regular random graphs, faster than the general degree sequence based generator. See more in the documentation.
This release includes the plfit library to maximum likelihood fit power laws to discrete or contiouous data. See more in the documentation.
Graph.Degree_Sequence()has a new method now:
rewire()has a new mode:
loops, that can create loop edges.
power_law_fit()now uses a C implementation.
frame_widthattribute or the
vertex_frame_widthkeyword argument in
Graph.write_svg(), thanks to drlog
Graph.TupleList, a function that allows one to create graphs with edge attributes quickly from a list of tuples.
plot() now also supports
.eps as an extension, not only
Graph.shortest_paths()(Dijkstra’s algorithm.) Thanks to Martin J Reed.
NCVsetting for ARPACK functions. It cannot be bigger than the matrix size.
Graph.layout_mds()that resulted vertices on top of each other.
Graph.radius(), the results were often simply wrong.
Graph.get.all.shortest.paths()when some edges had zero weight.
mode != ALL.
Graph.layout_sugiyama()when the graph had no edges.
Graph.community_label_propagation()when initial labels contained -1 entries. Issue #1105460.
DescartesCoordinateSystemclass (which is not used too frequently anyway)
Graphwas used in a thread forked from the main Python interpreter thread
has_multiple()that resulted in false negatives for some undirected graphs.