PIK-ICoNe / SyntheticNetworks-python

5 stars 0 forks source link

Bump python-igraph from 0.9.0 to 0.9.6 #12

Closed dependabot[bot] closed 3 years ago

dependabot[bot] commented 3 years ago

Bumps python-igraph from 0.9.0 to 0.9.6.

Release notes

Sourced from python-igraph's releases.

python-igraph 0.9.6

Fixed

  • Version 0.9.5 accidentally broke the Matplotlib backend when it was invoked without the mark_groups=... keyword argument; this version fixes the issue. Thanks to @​dschult for reporting it!

python-igraph 0.9.5

Fixed

  • plot(g, ..., mark_groups=True) now works with the Matplotlib plotting backend.

  • set_random_number_generator(None) now correctly switches back to igraph's own random number generator instead of the default one that hooks into the random module of Python.

  • Improved performance in cases when igraph has to call back to Python's random module to generate random numbers. One example is Graph.Degree_Sequence(method="vl"), whose performance suffered a more than 30x slowdown on 32-bit platforms before, compared to the native C implementation. Now the gap is smaller. Note that if you need performance and do not care about seeding the random number generator from Python, you can now use set_random_number_generator(None) to switch back to igraph's own RNG that does not need a roundtrip to Python.

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 a mode=... keyword argument.

  • Added a create_using=... keyword argument to Graph.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() and Graph.from_graph_tool() on large graphs, thanks to @​szhorvat and @​iosonofabio for fixing the issue.

  • Fixed the autocurve=... keyword argument of plot() 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, use mode=... instead.

  • igraph.graph.drawing.UbiGraphDrawer is deprecated as the upstream project is not maintained since 2008.

python-igraph 0.9.1

Changed

  • Calling plot() without a filename or a target surface is now deprecated. The original intention was to plot to a temporary file and then open it in

... (truncated)

Changelog

Sourced from python-igraph's changelog.

[0.9.6]

Fixed

  • Version 0.9.5 accidentally broke the Matplotlib backend when it was invoked without the mark_groups=... keyword argument; this version fixes the issue. Thanks to @​dschult for reporting it!

[0.9.5]

Fixed

  • plot(g, ..., mark_groups=True) now works with the Matplotlib plotting backend.

  • set_random_number_generator(None) now correctly switches back to igraph's own random number generator instead of the default one that hooks into the random module of Python.

  • Improved performance in cases when igraph has to call back to Python's random module to generate random numbers. One example is Graph.Degree_Sequence(method="vl"), whose performance suffered a more than 30x slowdown on 32-bit platforms before, compared to the native C implementation. Now the gap is smaller. Note that if you need performance and do not care about seeding the random number generator from Python, you can now use set_random_number_generator(None) to switch back to igraph's own RNG that does not need a roundtrip to Python.

[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 a mode=... keyword argument.

  • Added a create_using=... keyword argument to Graph.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() and Graph.from_graph_tool()

... (truncated)

Commits
  • f657a59 chore: bumped version to 0.9.56
  • 03368df chore: updated changelog [ci skip]
  • 713b811 fix: fix failing Matplotlib backend when mark_groups=... is not provided, fix...
  • 4c19544 chore: last tweaks to changelog [ci skip]
  • 0a153b3 chore: bumped version to 0.9.5
  • 1b2b0a3 fix: RNG performance improvements
  • fb47e3e fix: PyObject_CallObject() is slightly faster when generating random numbers
  • 0abc0dd fix: set_random_number_generator(None) now properly restores the original igr...
  • 883a05e Matplotlib plotting and clustering color bugfix (#410)
  • c1c3d8a ci: run verbose unit tests, add NetworkX in CI env
  • Additional commits viewable in compare view


Dependabot compatibility score

Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting @dependabot rebase.


Dependabot commands and options
You can trigger Dependabot actions by commenting on this PR: - `@dependabot rebase` will rebase this PR - `@dependabot recreate` will recreate this PR, overwriting any edits that have been made to it - `@dependabot merge` will merge this PR after your CI passes on it - `@dependabot squash and merge` will squash and merge this PR after your CI passes on it - `@dependabot cancel merge` will cancel a previously requested merge and block automerging - `@dependabot reopen` will reopen this PR if it is closed - `@dependabot close` will close this PR and stop Dependabot recreating it. You can achieve the same result by closing it manually - `@dependabot ignore this major version` will close this PR and stop Dependabot creating any more for this major version (unless you reopen the PR or upgrade to it yourself) - `@dependabot ignore this minor version` will close this PR and stop Dependabot creating any more for this minor version (unless you reopen the PR or upgrade to it yourself) - `@dependabot ignore this dependency` will close this PR and stop Dependabot creating any more for this dependency (unless you reopen the PR or upgrade to it yourself)
dependabot[bot] commented 3 years ago

Superseded by #16.