In this program
- Breadth-first and depth-first search
- Shortest paths: Dijkstra's algorithm (introduction)
- Matchings
- Hall's marriage theorem (statement)
- Vertex and edge colorings
- Ramsey theory (introduction)
Graph algorithms and structures
Shortest paths: Dijkstra's algorithm (introduction)
Graph theory & combinatorics · Standard syllabus
Topic
Shortest paths: Dijkstra's algorithm (introduction)
Undergraduate Graph Theory & Combinatorics — scope drawn from open graph theory texts and typical US combinatorics/graph theory syllabi.