Bump python-igraph from 0.9.0 to 0.10.2

[dependabot]

Bumps python-igraph from 0.9.0 to 0.10.2.

Release notes

Sourced from python-igraph's releases.

igraph 0.10.2

Added

• python-igraph is now tested in Python 3.11.
• Added Graph.modularity_matrix() to calculate the modularity matrix of a graph.
• Added Graph.get_k_shortest_paths(), thanks to @​sombreslames. See PR #577 for details.
• The setup.py script now also accepts environment variables instead of command line arguments to configure several aspects of the build process (i.e. whether a fully static extension is being built, or whether it is allowed to use pkg-config to retrieve the compiler and linker flags for an external igraph library instead of the vendored one). The environment variables are named similarly to the command line arguments but in uppercase, dashes replaced with underscores, and they are prefixed with IGRAPH_ (i.e. --use-pkg-config becomes IGRAPH_USE_PKG_CONFIG).

Changed

• The C core of igraph was updated to version 0.10.2, fixing a range of bugs originating from the C core.

Fixed

• Fixed a crash in Graph.decompose() that was accidentally introduced in 0.10.0 during the transition to igraph_graph_list_t in the C core.
• Clustering.sizes() now works correctly even if the membership vector contains None items.
• Graph.modularity() and Graph.community_multilevel() now correctly expose the resolution parameter.
• Fixed a reference leak in Graph.is_chordal() that decreased the reference count of Python's built-in True and False constants unnecessarily.
• Unit tests updated to get rid of deprecation warnings in Python 3.11.

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

... (truncated)

Changelog

Sourced from python-igraph's changelog.

[0.10.2] - 2022-10-14

Added

• python-igraph is now tested in Python 3.11.

• Added Graph.modularity_matrix() to calculate the modularity matrix of a graph.

• Added Graph.get_k_shortest_paths(), thanks to @​sombreslames. See PR #577 for details.

• The setup.py script now also accepts environment variables instead of command line arguments to configure several aspects of the build process (i.e. whether a fully static extension is being built, or whether it is allowed to use pkg-config to retrieve the compiler and linker flags for an external igraph library instead of the vendored one). The environment variables are named similarly to the command line arguments but in uppercase, dashes replaced with underscores, and they are prefixed with IGRAPH_ (i.e. --use-pkg-config becomes IGRAPH_USE_PKG_CONFIG).

Changed

• The C core of igraph was updated to version 0.10.2, fixing a range of bugs originating from the C core.

Fixed

• Fixed a crash in Graph.decompose() that was accidentally introduced in 0.10.0 during the transition to igraph_graph_list_t in the C core.

• Clustering.sizes() now works correctly even if the membership vector contains None items.

• Graph.modularity() and Graph.community_multilevel() now correctly expose the resolution parameter.

• Fixed a reference leak in Graph.is_chordal() that decreased the reference count of Python's built-in True and False constants unnecessarily.

• Unit tests updated to get rid of deprecation warnings in Python 3.11.

[0.10.1] - 2022-09-12

Added

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

• Graph.average_path_length() now supports edge weights.

... (truncated)

Commits

• ebef7af chore: bumped version number to 0.10.2
• bb1cb53 chore: added contributors file [ci skip]
• 88e3bfc chore: updated changelog [ci skip]
• 916a83d fix: fix two more issues found by static analysis
• e669a4e igraph logo in documentation template
• 8cc87ea fix: fix two more issues found by static analysids
• e2d76cd fix: better error handling for cases when CREATE_GRAPH() fails
• cbdc10d Move documentation examples to sphinx-gallery (#593)
• 648a2bb fix: fix a null pointer dereference in igraphmodule_i_Graph_isomorphic_vf2_ca...
• 10a5fb0 fix: gotten rid of unsafe casts of pointers-to-enums to pointers-to-ints, ref...
• 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]

Superseded by #41.