Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

build(deps): bump igraph from 0.10.6 to 0.10.8 #342

Merged
merged 1 commit into from
Sep 21, 2023

Conversation

dependabot[bot]
Copy link
Contributor

@dependabot dependabot bot commented on behalf of github Sep 17, 2023

Bumps igraph from 0.10.6 to 0.10.8.

Release notes

Sourced from igraph's releases.

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"

Changelog

Sourced from igraph's changelog.

[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.

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"

Commits
  • c61f7f0 chore: bumped version to 0.10.8
  • e624df9 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 #708
  • d3100c8 chore: bumped version to 0.10.7
  • 79fe9e6 refactor: use igraph_bipartite_game_gnp() or _gnm() instead of the deprecated...
  • f0287f5 fix: fix Pandas deprecation warning in unit tests, closes #705
  • a9c7d90 chore: updated changelog
  • f01bd6e chore: updated vendored C core
  • c5422ea Merge pull request #701 from igraph/dependabot/github_actions/pypa/cibuildwhe...
  • Additional commits viewable in compare view

Dependabot compatibility score

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 <dependency name> 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](https://github.com/igraph/python-igraph) from 0.10.6 to 0.10.8.
- [Release notes](https://github.com/igraph/python-igraph/releases)
- [Changelog](https://github.com/igraph/python-igraph/blob/main/CHANGELOG.md)
- [Commits](igraph/python-igraph@0.10.6...0.10.8)

---
updated-dependencies:
- dependency-name: igraph
  dependency-type: direct:production
  update-type: version-update:semver-patch
...

Signed-off-by: dependabot[bot] <support@github.com>
@dependabot dependabot bot added the dependencies Pull requests that update a dependency file label Sep 17, 2023
@RemyLau
Copy link
Collaborator

RemyLau commented Sep 21, 2023

@dependabot squash and merge

@dependabot dependabot bot merged commit 7093bfe into main Sep 21, 2023
@dependabot dependabot bot deleted the dependabot/pip/igraph-0.10.8 branch September 21, 2023 14:37
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
dependencies Pull requests that update a dependency file
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant