About igraph releases and other things
C/igraph 0.9.10, the tenth bugfix release of the 0.9 series, has arrived.
The source can be obtained from the GitHub releases page.
This release includes bug fixes and documentation improvements, and it is likely to be the last patch release of the 0.9.x series. Version 0.10.0 will follow soon with lots of breaking changes as we clean up the API in preparation for a future 1.0 release.
If you have a project that currently relies on igraph 0.9, it is advised that you update the project to use 0.9.10 and then start adapting it as soon as possible to support 0.10.0 once it is released.
Read on for more details about the changes in version 0.9.9.
igraph_reverse_edges()reverses the specified edges in the graph while preserving all attributes.
IGRAPH_ARPACK_PRODerror code is no longer used. Instead, the specific error encountered while doing matrix multiplication is reported.
igraph_local_scan_1_ecount()when the graph was directed but the mode was
IGRAPH_ALLand some nodes had loop edges. See issue #2092.
igraph_local_scan_neighborhood_ecount()when the graph was undirected.
igraph_pagerank()with the ARPACK method and
igraph_authority_score()could return incorrect results. The problem could be detected by checking that the returned eigenvalue is not negative. See issue #2090.
igraph_permute_vertices()now checks for out-of-range indices and duplicates in the permutation vector.
igraph_create()now checks for non-finite vertex indices in the edges vector.
igraph_eigenvector_centrality()would return incorrect scores when some weights were negative.
igraph_ess_seq()did not include the
tovertex in the sequence.
igraph_vit_create()now check that all edge/vertex indices are in range when creating iterators from sequence-type selectors.
igraph_grg_game()now validates its arguments.
igraph_layout_drl()and its 3D version now validate their inputs.
igraph_layout_drl(), as well as their 3D versions now check for non-positive weights.
igraph_community_spinglass()for null and singleton graphs.
igraph_layout_gem()does not crash any more for graphs with only a single vertex.
igraph_bridges()no longer uses recursion and thus is no longer prone to stack overflow.