Skip to content

build(deps): bump graphops from 0.1.4 to 0.5.0 - #1

Open
dependabot[bot] wants to merge 1 commit into
mainfrom
dependabot/cargo/graphops-0.5.0
Open

build(deps): bump graphops from 0.1.4 to 0.5.0#1
dependabot[bot] wants to merge 1 commit into
mainfrom
dependabot/cargo/graphops-0.5.0

Conversation

@dependabot

@dependabot dependabot Bot commented on behalf of github Jul 13, 2026

Copy link
Copy Markdown

Bumps graphops from 0.1.4 to 0.5.0.

Changelog

Sourced from graphops's changelog.

[0.5.0] - 2026-07-03

Added

  • hom_counts module: rooted walk and closed-walk counts per node — the tractable homomorphism-count families (rooted paths and cycles), grounded in the Dell-Grohe-Rattan treewidth/WL correspondence, intended as expressiveness-raising GNN node features.

[0.4.3]

Changed

  • Eigenvector L1 and current-flow-centrality L2 convergence residuals now route through innr::dense_f64 under the simd feature, matching pagerank/katz/betweenness. With innr 0.6.1 these f64 reductions dispatch to AVX-512/AVX2/NEON; portable fallback unchanged when simd is off.

[0.4.1]

Documented

  • newman_betweenness now documents its scaling behavior up front: exact mode is O(n^2 * max_iter * d) and recommends sampling for n >= 500 (n_sources = sqrt(n) rule of thumb) and is impractical above n = 10000. Previously a user could call the function with default config on a large graph and silently wait for hours.
  • katz_centrality and newman_betweenness both note that no in-tree consumer currently uses them (sheaf's community-detection path uses Leiden/Louvain, not centrality). They are speculative additions, not consumer-driven, and exist for callers with their own use cases.

[0.4.0]

Added

  • newman_betweenness (and _run / _checked variants) — Newman (2005) random-walk betweenness centrality. Each source-sink pair contributes via a Jacobi-solved current-flow on the graph Laplacian; node scores aggregate edge currents incident to each node. NewmanBetweennessConfig defaults: n_sources = usize::MAX (exact, all sources), seed = 42, max_iter = 200, tolerance = 1e-6. Set n_sources smaller for an approximation that scales to larger graphs.
  • betweenness module is now unconditionally compiled; the existing petgraph-based Brandes impl is internally feature-gated. Newman has no petgraph dependency.

[0.3.0]

Added

... (truncated)

Commits
  • 001004b hom_counts: rooted walk and closed-walk profiles
  • 60c55ec rosetta: ground betweenness centrality in networkx
  • 7c91910 graphops: tighten example prose
  • a9f0a47 graphops: add rosetta correctness fixtures vs networkx
  • eef9185 graphops: add lazy frontier expansion proof
  • b607f4f examples: allow needless_range_loop in pagerank_validation matrix builders
  • 3e74d51 examples: add pagerank_validation on exact graphs and Cora
  • 0ed21c5 Merge pull request #1 from arclabs561/examples/guide-and-comment-fixes
  • 4c059e6 graphops: add examples guide
  • 3af7230 docs: bump README install pin to 0.4.3 + fix node-id intra-doc escape
  • Additional commits viewable in compare view

@dependabot dependabot Bot added dependencies Pull requests that update a dependency file rust Pull requests that update rust code labels Jul 13, 2026
Bumps [graphops](https://github.com/arclabs561/graphops) from 0.1.4 to 0.5.0.
- [Changelog](https://github.com/arclabs561/graphops/blob/main/CHANGELOG.md)
- [Commits](arclabs561/graphops@v0.1.4...v0.5.0)

---
updated-dependencies:
- dependency-name: graphops
  dependency-version: 0.5.0
  dependency-type: direct:production
  update-type: version-update:semver-minor
...

Signed-off-by: dependabot[bot] <support@github.com>
@dependabot
dependabot Bot force-pushed the dependabot/cargo/graphops-0.5.0 branch from 84f9973 to 0b18b7e Compare July 13, 2026 22:44
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 rust Pull requests that update rust code

Projects

None yet

Development

Successfully merging this pull request may close these issues.

0 participants