icentral-path-counts
v0.1.0 ExperimentalA crate for managing path counts of nodes in graph-like structures, designed for efficient performance in computational graph analysis.
Quick Verdict
- !Pre-1.0: API may have breaking changes
- ✓Tiny footprint (15KB, 3 deps)
- ✓Permissive license (MIT OR Apache-2.0)
Security
Deep Insights
417 downloads in the last 30 days (14/day). Volume is roughly flat compared to the previous period.
The primary maintainer publishes 625 crates. This suggests deep Rust expertise and long-term commitment to the ecosystem.
Only 3 direct dependencies. Lean dependency tree means faster builds and lower supply chain risk.
At 15KB, icentral-path-counts is lightweight. Small crate size correlates with focused, well-scoped functionality.
Notable dependents include icentral-subgraph, icentral-brandes, icentral-delta, icentral-graph, icentral-graph-hash. When high-quality crates choose icentral-path-counts, it's a strong quality signal.
Health Breakdown
Recency, release consistency, active ratio
Yanked ratio, deps, size, maturity, features
Reverse deps, ownership, ecosystem
Downloads, momentum, growth trend
Docs, repo, license, metadata
Download Trend
Top Dependents
Most downloaded crates that depend on icentral-path-counts
