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.
See more here:
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 manual.
It is possible now to generate regular random graphs, faster than the general degree sequence based generator. See more in the reference manual.
This release includes the plfit library to maximum likelihood fit power laws to discrete or contiouous data. See more in the reference manual.
igraph_layout_mds()uses LAPACK instead of ARPACK.
igraph_degree_sequence_gamehas a new method:
igraph_rewire()has a new method:
IGRAPH_REWIRING_SIMPLE_LOOPS, that can create loops.
outseqwas an empty vector.
igraph_all_minimal_st_separators()bug, some vertex sets were incorrectly reported as separators. Bug #1033045.
igraph_shortest_paths_dijkstra(), thanks to Martin J Reed.
NCVsetting for ARPACK functions. It cannot be bigger than the matrix size.
igraph_layout_merge_dlauses better default parameter values now.
igraph_layout_mds()that resulted vertices on top of each other.
IGRAPH_NANfor isomorphism classes that are not motifs (i.e. not connected). Fixes bug #1050859.
degree_sequence_game(), in_seq can be an empty vector as well instead of NULL, for an undirected graph.
igraph_radius()), the results were often simply wrong.
igraph_get_all_shortest_paths_dijkstra()when edges had zero weight.
mode != ALL.
igraph_has_multiple()that resulted in false negatives for some undirected graphs.