python-igraph 0.9.4
Added
-
Added
Graph.is_tree()
to test whether a graph is a tree. -
Added
Graph.Realize_Degree_Sequence()
to construct a graph that realizes a given degree sequence, using a deterministic (Havel-Hakimi-style) algorithm. -
Added
Graph.Tree_Game()
to generate random trees with uniform sampling. -
Graph.to_directed()
now supports amode=...
keyword argument. -
Added a
create_using=...
keyword argument toGraph.to_networkx()
to let the user specify which NetworkX class to use when converting the graph.
Changed
- Updated igraph dependency to 0.9.4.
Fixed
-
Improved performance of
Graph.from_networkx()
andGraph.from_graph_tool()
on large graphs, thanks to @szhorvat and @iosonofabio for fixing the issue. -
Fixed the
autocurve=...
keyword argument ofplot()
when using the Matplotlib backend.
Deprecated
-
Functions and methods that take string arguments that represent an underlying enum in the C core of igraph now print a deprecation warning when provided with a string that does not match one of the enum member names (as documented in the docstrings) exactly. Partial matches will be removed in the next minor or major version, whichever comes first.
-
Graph.to_directed(mutual=...)
is now deprecated, usemode=...
instead. -
igraph.graph.drawing.UbiGraphDrawer
is deprecated as the upstream project is not maintained since 2008.