56
bit_gossip
v0.0.13 GrowingPathfinding library for calculating all node pairs' shortest paths in an unweighted undirected graph.
MIT OR Apache-2.0 Edition 2021 MSRV 1.56
AlgorithmsData structuresMathematicsGame development #search#pathfinding#graph#shortest-path#all-pairs
Quick Verdict
- ✕Not updated for 1+ year
- !Pre-1.0: API may have breaking changes
- ✓Tiny footprint (29KB, 3 deps)
- ✓Permissive license (MIT OR Apache-2.0)
Security
Checking security advisories...
Downloads
13.7K
Dependents
0
Releases
13
Size
29KB
Deep Insights
📊
Download activity
44 downloads in the last 30 days (1/day avg).
🔬
Pre-1.0 for over a year
Despite being 1+ years old, bit_gossip hasn't reached 1.0 yet. Expect potential API changes between versions.
🪶
Minimal dependencies
Only 3 direct dependencies. Lean dependency tree means faster builds and lower supply chain risk.
📐
Compact crate
At 29KB, bit_gossip is lightweight. Small crate size correlates with focused, well-scoped functionality.
Health Breakdown
Maintenance 13/25
Recency, release consistency, active ratio
Quality 17/25
Yanked ratio, deps, size, maturity, features
Community 6/20
Reverse deps, ownership, ecosystem
Popularity 5/15
Downloads, momentum, growth trend
Documentation 15/15
Docs, repo, license, metadata
Download Trend
Daily downloads · last 90 days
1/day avg-81%
Version Adoption
v0.0.13
24%
v0.0.12
20%
v0.0.10
19%
v0.0.8
19%
v0.0.11
19%
Release Timeline
13 releasessince 2024
J
F
M
A
M
J
J
A
S
O
N
D
2024
13
2025
2026
LessMore
Feature Flags
default =["parallel"]
parallel*
README
Loading README...
Maintainers
Dependencies
3
direct dependencies
Dependents
0
crates depend on bit_gossip