Skip to content

igraph 0.10.8
Compare
Choose a tag to compare
@ntamas ntamas released this 12 Sep 20:44
· 267 commits to main since this release
0.10.8
c61f7f0
This commit was signed with the committer’s verified signature.
ntamas Tamás Nepusz
GPG key ID: 6C883B882DD7B3D1
Learn about vigilant mode.

Yes, the version number is correct - igraph 0.10.7 has never made it to PyPI. It is tagged in the repository, but it has never been released officially. The changelog below lists the changes between igraph 0.10.6 and 0.10.8.

Added

  • Added is_bigraphical() to test whether a pair of integer sequences can be the degree sequence of some bipartite graph.

  • Added weights=... keyword argument to Graph.radius() and Graph.eccentricity().

  • Graph.distances(), Graph.get_shortest_path() and Graph.get_shortest_paths() now allow the user to select the algorithm to be used explicitly.

Changed

  • The C core of igraph was updated to version 0.10.7.

  • Graph.distances() now uses Dijkstra's algorithm when there are zero weights but no negative weights. Earlier versions switched to Bellman-Ford or Johnson in the presence of zero weights unnecessarily.

Fixed

  • Fixed a bug in EdgeSeq.select(_incident=...) for undirected graphs.

  • Fixed a memory leak in Graph.distances() when attempting to use Johnson's algorithm with mode != "out"

Assets 53
Loading