Skip to content

fork Graph data structure library for Rust.

active 2023-08-152026-08-15 (UTC)

Complete coverage26,322 / 26,322 hourly files (100%) · 2 absent upstream2023-08-152026-08-15 (UTC)
Events
3.8K
Pushes
414
Pull requests
308
Issues
178
Stars
1.3K
Forks
150

Activity over time

Daily event counts in the loaded window

Line chart, 1097 days from 2023-08-15 to 2026-08-15. Pushes: 414 total, peak 18 in a day. Pull requests: 308 total, peak 9 in a day. Issues: 178 total, peak 6 in a day. Comments: 886 total, peak 39 in a day. Stars: 1,300 total, peak 36 in a day.

  • Pushes
  • Pull requests
  • Issues
  • Comments
  • Stars

Stars, PRs, issues and forks are under-captured in the later part of this window. GH Archive progressively stopped capturing non-push events during 2026 — −95% or worse by the end of the window. Every series here except Pushes fades for that reason, so a decline above reflects the archive, not this repository. Pushes stay reliable throughout, so read them, and the contributor counts derived from them, as the real signal. Data health has the measurements.

Top contributors

Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity

ContributorContributionsPushesPRsComments
RaoulLuque3783943210
starovoid3614365168
ABorgna199424948
indietyp1941171943
github-actions[bot]11284523
XVilka100131639
github-merge-queue[bot]666600
bluss5010429
BryanCruz4001021
AnarchistHoneybun290422
Dietr1ch270117
cuviper210412
daniel-levin190111
daehiff16049
Bromind150112
marcospb1911027
michaelgoldenn9016
lmondada9026
zhumingpassional8003
daniel-pfeiffer7006

Recent activity

Latest issues, pull requests and releases

  • Issue comment#980Whatsonyourmind2026-04-05 21:02
    Floyd–Warshall can invent finite distances for unreachable pairs when negative edges are present
  • Pull request#986viniciusdutra3142026-04-04 17:01
  • Issue comment#980Whatsonyourmind2026-04-03 06:05
    Floyd–Warshall can invent finite distances for unreachable pairs when negative edges are present
  • Issue comment#982kulach2026-04-02 11:22
    feat: Implemented the Knuth-Szwarcfiter algorithm to find all topological sorts
  • Issue comment#981kulach2026-03-20 22:59
    All Topological Sort Generator
  • Issue#981kulach2026-03-16 01:06
    All Topological Sort Generator
  • Issue comment#980RaoulLuque2026-03-15 08:38
    Floyd–Warshall can invent finite distances for unreachable pairs when negative edges are present
  • Issue comment#980RaoulLuque2026-03-15 08:34
    Floyd–Warshall can invent finite distances for unreachable pairs when negative edges are present
  • Issue#979meng-xu-cs2026-03-15 04:28
    `MatrixGraph` edge writers allow removed and never-inserted node ids as endpoints
  • Issue#977meng-xu-cs2026-03-15 04:03
    `NodeFiltered` leaks filtered-out elements through delegated index traits and `edge_weight`
  • Issue#970meng-xu-cs2026-03-15 02:34
    `articulation_points` panics on non-empty StableGraph
  • Issue#969meng-xu-cs2026-03-15 02:18
    `graph6` decoder panics on malformed or truncated input
  • Issue comment#967SuchAFuriousDeath2026-02-27 00:03
    chore: Bump hashbrown to ^0.16
  • Issue comment#967RaoulLuque2026-02-26 08:27
    chore: Bump hashbrown to ^0.16
  • Pull request#964RaoulLuque2026-02-18 19:49
  • Pull request#963ajit2832026-02-16 20:16
  • Pull request#961Avandar20242026-02-13 01:19
  • Issue#960Avandar20242026-02-12 15:56
    Fix the error in the implementation of page_rank algorithm
  • Issue comment#959Avandar20242026-02-12 02:33
    perf: optimize PageRank implementation to reduce complexity and allocations
  • Issue comment#959RaoulLuque2026-02-11 15:48
    perf: optimize PageRank implementation to reduce complexity and allocations
  • Pull request#959Avandar20242026-02-11 03:22
  • Issue#958RaoulLuque2026-02-07 14:47
    Fix or remove release-plz for 0.8.
  • Pull request#957RaoulLuque2026-02-07 14:33
  • Pull request#956github-actions[bot]2026-02-07 13:41
  • Pull request#955github-actions[bot]2026-02-07 13:41

Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 1,300 stars here means stars gained during the window, not the repo's star count.