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