- Kruskal's algorithm for finding MSTs in Boost
- Kosaraju's algorithm for finding SCCs in LEDA.
- Shortest Augmenting Path algorithm for Maximum Flow.
a collection of algorithms on graphs using Boost and LEDA
a collection of algorithms on graphs using Boost and LEDA
MIT License