A collection of algorithms on graphs implemented in Rust just for fun.
| Algorithm | Implemented |
|---|---|
| Stoer and Wagner minimum cut | ❌ |
| Karger and Stein minimum cut | ❌ |
| Graph coloring | ❌ |
| Minimum vertex cover | ❌ |
| Vertex cover | ❌ |
| Travelling Salesman Problem | ❌ |
| Bellman–Ford algorithm | ❌ |
| Dijkstra's algorithm | ❌ |
| Prim's algorithm | ✔️ |
| Connectivity s-t | ❌ |
| Finding out all cycles | ❌ |
| Counting connected components | ✔️ |
| A* search | ❌ |
| Kruskal's algorithm with union find | ✔️ |
| Kruskal's algorithm | ✔️ |
| Checking for ciclicity | ✔️ |