Bump python-igraph from 0.9.0 to 0.10.4

[dependabot]

Bumps python-igraph from 0.9.0 to 0.10.4.

Release notes

Sourced from python-igraph's releases.

igraph 0.10.4

Added

• Added Graph.vertex_coloring_greedy() to calculate a greedy vertex coloring for the graph.
• Betweenness and edge betweenness scores can now be calculated for a subset of the shortest paths originating from or terminating in a certain set of vertices only.

Fixed

• Fixed the drawing of VertexDendrogram instances, both in the Cairo and the Matplotlib backends.
• The cutoff and normalized arguments of Graph.closeness() did not function correctly.

igraph 0.10.3

Changed

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

• UMAP layout now exposes the computation of the symmetrized edge weights via umap_compute_weights(). The layout function, Graph.layout_umap(), can now be called either on a directed graph with edge distances, or on an undirected graph with edge weights, typically computed via umap_compute_weights() or precomputed by the user. Moreover, the sampling_prob argument was faulty and has been removed. See PR #613 for details.

• The resolution_parameter argument of Graph.community_leiden() was renamed to resolution for sake of consistency. The old variant still works with a deprecation warning, but will be removed in a future version.

Fixed

• Graph.Data_Frame() now handles the Int64 data type from pandas, thanks to @​Adriankhl. See PR #609 for details.

• Graph.layout_lgl() root argument is now optional (as it should have been).

• The VertexClustering class now handles partial dendrograms correctly.

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

... (truncated)

Changelog

Sourced from python-igraph's changelog.

[0.10.4] - 2022-01-27

Added

• Added Graph.vertex_coloring_greedy() to calculate a greedy vertex coloring for the graph.

• Betweenness and edge betweenness scores can now be calculated for a subset of the shortest paths originating from or terminating in a certain set of vertices only.

Fixed

• Fixed the drawing of VertexDendrogram instances, both in the Cairo and the Matplotlib backends.
• The cutoff and normalized arguments of Graph.closeness() did not function correctly.

[0.10.3] - 2022-12-31

Changed

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

• UMAP layout now exposes the computation of the symmetrized edge weights via umap_compute_weights(). The layout function, Graph.layout_umap(), can now be called either on a directed graph with edge distances, or on an undirected graph with edge weights, typically computed via umap_compute_weights() or precomputed by the user. Moreover, the sampling_prob argument was faulty and has been removed. See PR #613 for details.

• The resolution_parameter argument of Graph.community_leiden() was renamed to resolution for sake of consistency. The old variant still works with a deprecation warning, but will be removed in a future version.

Fixed

• Graph.Data_Frame() now handles the Int64 data type from pandas, thanks to @​Adriankhl. See PR #609 for details.

• Graph.layout_lgl() root argument is now optional (as it should have been).

• The VertexClustering class now handles partial dendrograms correctly.

[0.10.2] - 2022-10-14

Added

• python-igraph is now tested in Python 3.11.

... (truncated)

Commits

• b6ebd8e fix: set up appropriate default for the vertex coloring heuristics
• 580cf5d chore: bumped version to 0.10.4
• c710884 fix: remove deprecated construct from a unit test
• 06d120a feat: added Graph.vertex_coloring_greedy()
• 3047d7d feat: added support for sources=... and targets=... for betweenness and edge ...
• f3c1e11 chore: bumped vendored igraph to 0.10.4
• 6792363 doc: following up the master -> main rename in source files
• 4262c32 chore: update changelog [skip ci]
• 8c260e9 fix: closeness_cutoff() broken handloing of cutoff argument
• 222efa9 feat: skip header installation when building a wasm wheel with emscripten
• 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)