- Introduction
- Graph Traversal and Minimum Spanning Tree
- Kruskal Algorithm
- Prims Algorithm
- Boruvkas Algorithm
- Shortest Path Algorithm - Dijsktra
- More Shortest Path Algorithm - Dijsktra
- Connectivity
- General Connectivity
- Euler Tour
- Hamilton Tour
- Bipartite Matching
- Maximum Matching
- Planarity
- Maximum Clique
- 2-Colorability
- 3-Colorability
- Shortest Paths
- Longest Paths
- Vertex Cover
- Isomorphism
- Digraphs
- Transitive Closure
- Strong Connectivity
- Odd-length Cycle
- Even-length Cycle
- Weighted Graphs
- Minimum Spanning Tree
- Traveling Salesperson
- Networks
- Shortest Paths (nonnegative weights)
- Shortest Paths (negative weights)
- Maximum Flow
- Assignment
- Minimum-cost Flow