| core data structure | |
| easy to use/test macros | |
| dfs | dfs |
| iddfs | |
| bfs | |
| DAG’s topological sort | dfs |
| reference count | |
| strongly connected compoments (SCC) | |
| minimum spanning tree | kruskal |
| prim | |
| single source shortest path | dijkstra |
| A* | |
| bellman ford | |
| spfa | |
| multiple sources shortest path | johnson |
| floyd warshall | |
| augment path | bipartite matching |
| vertex disjoint paths | |
| edge disjoint paths | |
| maxflow (ford fulkerson) | edmonds karp |
| dinic (new) | |
| min-cost max-flow |
iter & and &mut are hard to use, so I used owned version, and using outer variables to mutate graph