Bump python-igraph from 0.9.0 to 0.10.1

[dependabot[bot]]

Bumps python-igraph from 0.9.0 to 0.10.1.

Release notes

Sourced from python-igraph's releases.

igraph 0.10.1

Added

• Added Graph.minimum_cycle_basis() and Graph.fundamental_cycles()
• Graph.average_path_length() now supports edge weights.

Fixed

• Restored missing exports from igraph.__all__ that used to be in the main igraph package before 0.10.0.

igraph 0.10.0

Added

• More robust support for Matplotlib and initial support for plotly as graph plotting backends, controlled by a configuration option. See PR #425 for more details.

• Added support for additional ways to construct a graph, such as from a dictionary of dictionaries, and to export a graph object back to those data structures. See PR #434 for more details.

• Graph.list_triangles() lists all triangles in a graph.

• Graph.reverse_edges() reverses some or all edges of a graph.

• Graph.Degree_Sequence() now supports the "no_multiple_uniform" generation method, which generates simple graphs, sampled uniformly, using rejection sampling.

• Graph.Lattice() now supports per-dimension periodicity control.

• Graph.get_adjacency() now allows the user to specify whether loop edges should be counted once or twice, or not at all.

• Graph.get_laplacian() now supports left-, right- and symmetric normalization.

Changed

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

• We now publish abi3 wheels on PyPI from CPython 3.9 onwards, making it possible to use an already-built Python wheel with newer minor Python releases (and also reducing the number of wheels we actually need to publish). Releases for CPython 3.7 and 3.8 still use version-specific wheels because the code of the C part of the extension contains conditional macros for CPython 3.7 and 3.8.

• Changed default value of the use_vids=... argument of Graph.DataFrame() to True, thanks to @​fwitter.

• Graph.Degree_Sequence() now accepts all sorts of sequences as inputs, not only lists.

Fixed

• The Matplotlib backend now allows edge_color and edge_width to be set on an edge-by-edge basis.

Removed

• Dropped support for Python 3.6.

• Removed deprecated UbiGraphDrawer.

... (truncated)

Changelog

Sourced from python-igraph's changelog.

[0.10.1] - 2022-09-12

Added

• Added Graph.minimum_cycle_basis() and Graph.fundamental_cycles()

• Graph.average_path_length() now supports edge weights.

Fixed

• Restored missing exports from igraph.__all__ that used to be in the main igraph package before 0.10.0.

[0.10.0] - 2022-09-05

Added

• More robust support for Matplotlib and initial support for plotly as graph plotting backends, controlled by a configuration option. See PR #425 for more details.

• Added support for additional ways to construct a graph, such as from a dictionary of dictionaries, and to export a graph object back to those data structures. See PR #434 for more details.

• Graph.list_triangles() lists all triangles in a graph.

• Graph.reverse_edges() reverses some or all edges of a graph.

• Graph.Degree_Sequence() now supports the "no_multiple_uniform" generation method, which generates simple graphs, sampled uniformly, using rejection sampling.

• Graph.Lattice() now supports per-dimension periodicity control.

• Graph.get_adjacency() now allows the user to specify whether loop edges should be counted once or twice, or not at all.

• Graph.get_laplacian() now supports left-, right- and symmetric normalization.

• Graph.modularity() now supports setting the resolution with the resolution=... parameter.

Changed

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

• We now publish abi3 wheels on PyPI from CPython 3.9 onwards, making it possible to use an already-built Python wheel with newer minor Python

... (truncated)

Commits

• c3df47e chore: trigger build
• 70d66c4 chore: updated changelog [ci skip]
• a30ca7c refactor: finalized error checking improviements in attributes.c
• ecfebc0 refactor: more cleanup in attribute handling code [WIP]
• 1d5a310 refactor: simplifying attribute handler code and improving resilience to erro...
• 562c05f feat: Graph.average_path_length() now supports weights
• 742d3b5 chore: updated changelog [ci skip]
• d0e9078 feat: added Graph.minimum_cycle_basis() and Graph.fundamental_cycles()
• 3db29fc networkx g.nodes is not a list but is iterable (#567)
• 47501ad fix: remove unneeded unrolling of dict.items() in several parts of the code
• Additional commits viewable in compare view

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]]

Superseded by #38.