Decision Workspace
mcmf vs pathfinding vs obzenflow-topology
Side-by-side comparison of Rust crates
41
mcmf
growingv2.0.0
This crate is for solving instances of the minimum cost maximum flow problem. It uses the network simplex algorithm from the LEMON graph optimization library.
69
pathfinding
stablev4.15.0
Pathfinding, flow, and graph algorithms
52
obzenflow-topology
experimentalv0.3.1
Flow topology graph structures for ObzenFlow
Core Metrics
| mcmf | pathfinding | obzenflow-topology | |
|---|---|---|---|
| Health Score | 41 | 69 | 52 |
| Total Downloads | 29.3K | 2.0M | 1.3K |
| 30d Downloads | 688 | 94.2K | 933 |
| Dependents | 1 | 487 | 8 |
| Releases | 3 | 133 | 3 |
| Last Updated | 2766d ago | 17d ago | 26d ago |
| Age | 8y 3m | 9y 3m | 2m |
Health Breakdown
mcmf
Maintenance
3
Quality
19
Community
6
Popularity
5
Documentation
8
pathfinding
Maintenance
18
Quality
16
Community
12
Popularity
8
Documentation
15
obzenflow-topology
Maintenance
12
Quality
14
Community
9
Popularity
4
Documentation
13
Technical Details
| mcmf | pathfinding | obzenflow-topology | |
|---|---|---|---|
| Version | 2.0.0 | 4.15.0 | 0.3.1 |
| Stable (≥1.0) | ✓ Yes | ✓ Yes | ✗ No |
| License | MIT | Apache-2.0/MIT | MIT OR Apache-2.0 |
| Dependencies | 1 | 16 | 6 |
| Crate Size | 440KB | 182KB | 43KB |
| Features | 0 | 1 | 1 |
| Yanked % | 0.0% | 1.5% | 0.0% |
| Edition | — | 2024 | 2021 |
| MSRV | — | 1.87.0 | — |
| Owners | 1 | 1 | 1 |
Links
Quick Verdict
- •pathfinding leads with a health score of 69/100, but none of the options score above 80.
- •pathfinding is depended on by 487 crates — strongest ecosystem trust.
- •⚠ mcmf has not been updated in over a year.
- •obzenflow-topology is pre-1.0 — API may change.