Added weights=... keyword argument to Graph.layout_kamada_kawai().
Changed
The matplotlib plotting infrastructure underwent major surgery and is now able to show consistent vertex and edge drawings at any level of zoom, including with animations, and for any aspect ratio.
As a consequence of the restructuring at the previous point, vertex sizes are now specified in figure points and are not affected by axis limits or zoom. With the current conventions, vertex_size=25 is a reasonable size for igraph.plot.
As another consequence of the above, vertex labels now support offsets from the vertex center, in figure point units.
As another consequence of the above, self loops are now looking better and their size can be controlled using the edge_loop_size argument in igraph.plot.
As another consequence of the above, if using the matplotlib backend when plotting a graph, igraph.plot now does not return the Axes anymore. Instead, it returns a container artist called GraphArtist, which contains as children the elements of the graph plot: a VertexCollection for the vertices, and EdgeCollection for the edges, and so on. These objects can be used to modify the plot after the initial rendering, e.g. inside a Jupyter notebook, to fine tune the appearance of the plot. While documentation on specific graphic elements is still scant, more descriptive examples will follow in the future.
Fixed
Fixed drawing order of vertices in the Plotly backend (#691).
Fixed plotting of null graphs with the Matplotlib backend.
Removed
Dropped support for Python 3.7 as it has reached its end of life.
igraph 0.10.8
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"
Fixed plotting of null graphs with the Matplotlib backend.
[0.11.0] - 2023-10-12
Added
python-igraph is now tested in Python 3.12.
Added weights=... keyword argument to Graph.layout_kamada_kawai().
Changed
The matplotlib plotting infrastructure underwent major surgery and is now able to show consistent vertex and edge drawings at any level of zoom, including with animations, and for any aspect ratio.
As a consequence of the restructuring at the previous point, vertex sizes are now specified in figure points and are not affected by axis limits or zoom. With the current conventions, vertex_size=25 is a reasonable size for igraph.plot.
As another consequence of the above, vertex labels now support offsets from the vertex center, in figure point units.
As another consequence of the above, self loops are now looking better and their size can be controlled using the edge_loop_size argument in igraph.plot.
As another consequence of the above, if using the matplotlib backend when plotting a graph, igraph.plot now does not return the Axes anymore. Instead, it returns a container artist called GraphArtist, which contains as children the elements of the graph plot: a VertexCollection for the vertices, and EdgeCollection for the edges, and so on. These objects can be used to modify the plot after the initial rendering, e.g. inside a Jupyter notebook, to fine tune the appearance of the plot. While documentation on specific graphic elements is still scant, more descriptive examples will follow in the future.
Fixed
Fixed drawing order of vertices in the Plotly backend (#691).
Removed
Dropped support for Python 3.7 as it has reached its end of life.
[0.10.8] - 2023-09-12
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().
[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.
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.11.2.
Release notes
Sourced from igraph's releases.
... (truncated)
Changelog
Sourced from igraph's changelog.
... (truncated)
Commits
a249b9a
chore: bumped version to 0.11.2355b303
ci: increase test tolerance for Matplotlib tests to make sure they pass on aa...5c8b36c
chore: bumped version to 0.11.139d437f
fix: fix plotting of null graphs with the Matplotlib backend98b0c93
doc: add switch to doc building script to ensure that the docs build from scr...fe71982
chore: bumped version to 0.11.0a94e066
Merge branch 'develop'b868429
ci: another attempt to fix the Webassembly build, now we call the fixer scrip...e7903df
ci: another attempt to fix the Webassembly build6ba46cf
fix: fix hardcoded CMake config name in setup.pyDependabot 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