| A |
Single source shortest path, non-negative weights
|
| B |
Single source shortest path, time table
|
| C |
Single source shortest path, negative weights
|
| D |
All Pairs Shortest Path
|
| E |
Minimum Spanning Tree
|
| F |
Maximum Flow
|
| G |
Minimum Cut
|
| H |
Minimum Cost Maximum Flow
|
| I |
Eulerian Path
|
