Yes, the version number is correct - igraph 0.10.7 has never made it to PyPI. It is tagged in the repository, but it has never been released officially. The changelog below lists the changes between igraph 0.10.6 and 0.10.8.
Added
Added is_bigraphical() to test whether a pair of integer sequences can be the degree sequence of some bipartite graph.
Added weights=... keyword argument to Graph.radius() and Graph.eccentricity().
Graph.distances(), Graph.get_shortest_path() and Graph.get_shortest_paths() now allow the user to select the algorithm to be used explicitly.
Changed
The C core of igraph was updated to version 0.10.7.
Graph.distances() now uses Dijkstra's algorithm when there are zero weights but no negative weights. Earlier versions switched to Bellman-Ford or Johnson in the presence of zero weights unnecessarily.
Fixed
Fixed a bug in EdgeSeq.select(_incident=...) for undirected graphs.
Fixed a memory leak in Graph.distances() when attempting to use Johnson's algorithm with mode != "out"
igraph 0.10.6
Changed
The C core of igraph was updated to version 0.10.6.
Graph.Incidence() is now deprecated in favour of Graph.Biadjacency() as it constructs a bipartite graph from a bipartite adjacency matrix. (The previous name was a mistake). Future versions might re-introduce Graph.Incidence() to construct a graph from its incidence matrix.
Graph.get_incidence() is now deprecated in favour of Graph.get_biadjacency() as it returns the bipartite adjacency matrix of a graph and not its incidence matrix. (The previous name was a mistake). Future versions might re-introduce Graph.get_incidence() to return the incidence matrix of a graph.
Reverted the change in 0.10.5 that prevented adding vertices with integers as vertex names. Now we show a deprecation warning instead, and the addition of vertices with integer names will be prevented from version 0.11.0 only.
Fixed
Fixed a minor memory leak in Graph.decompose().
The default vertex size of the Plotly backend was fixed so the vertices are now visible by default without specifying an explicit size for them.
igraph 0.10.5
Added
The plot() function now takes a backend keyword argument that can be used to specify the plotting backend explicitly.
The VertexClustering object returned from Graph.community_leiden() now contains an extra property named quality that stores the value of the internal quality function optimized by the algorithm.
Graph.Adjacency() and Graph.Weighted_Adjacency() now supports loops="once", loops="twice" and loops="ignore" to control how loop edges are handled in a more granular way. loops=True and loops=False keep on working as in earlier versions.
Added Graph.get_shortest_path() as a convenience function for cases when only one shortest path is needed between a given source and target vertices.
Added is_bigraphical() to test whether a pair of integer sequences can be the degree sequence of some bipartite graph.
Added weights=... keyword argument to Graph.radius() and Graph.eccentricity().
[0.10.7] - 2023-09-04
Added
Graph.distances(), Graph.get_shortest_path() and Graph.get_shortest_paths() now allow the user to select the algorithm to be used explicitly.
Changed
The C core of igraph was updated to version 0.10.7.
Graph.distances() now uses Dijkstra's algorithm when there are zero weights but no negative weights. Earlier versions switched to Bellman-Ford or Johnson in the presence of zero weights unnecessarily.
Fixed
Fixed a bug in EdgeSeq.select(_incident=...) for undirected graphs.
Fixed a memory leak in Graph.distances() when attempting to use Johnson's algorithm with mode != "out"
[0.10.6] - 2023-07-13
Changed
The C core of igraph was updated to version 0.10.6.
Graph.Incidence() is now deprecated in favour of Graph.Biadjacency() as it constructs a bipartite graph from a bipartite adjacency matrix. (The previous name was a mistake). Future versions might re-introduce Graph.Incidence() to construct a graph from its incidence matrix.
Graph.get_incidence() is now deprecated in favour of Graph.get_biadjacency() as it returns the bipartite adjacency matrix of a graph and not its incidence matrix. (The previous name was a mistake). Future versions might re-introduce Graph.get_incidence() to return the incidence matrix of a graph.
Reverted the change in 0.10.5 that prevented adding vertices with integers as vertex names. Now we show a deprecation warning instead, and the addition of vertices with integer names will be prevented from version 0.11.0 only.
Fixed
Fixed a minor memory leak in Graph.decompose().
The default vertex size of the Plotly backend was fixed so the vertices are
now visible by default without specifying an explicit size for them.
[0.10.5] - 2023-06-30
Added
The plot() function now takes a backend keyword argument that can be used
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 show ignore conditions` will show all of the ignore conditions of the specified dependency
- `@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)
Bumps igraph from 0.9.8 to 0.10.8.
Release notes
Sourced from igraph's releases.
... (truncated)
Changelog
Sourced from igraph's changelog.
... (truncated)
Commits
c61f7f0
chore: bumped version to 0.10.8e624df9
feat: added weights=... argument to Graph.radius() and Graph.eccentricity()b7d33f2
fix: added missing error handling to Graph.Random_Bipartite()cddbc55
feat: exposed igraph_is_bigraphical(), closes #708d3100c8
chore: bumped version to 0.10.779fe9e6
refactor: use igraph_bipartite_game_gnp() or _gnm() instead of the deprecated...f0287f5
fix: fix Pandas deprecation warning in unit tests, closes #705a9c7d90
chore: updated changelogf01bd6e
chore: updated vendored C corec5422ea
Merge pull request #701 from igraph/dependabot/github_actions/pypa/cibuildwhe...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 show