Graph algorithms and structures
Graph theory & combinatorics · Standard syllabus
Breadth-first and depth-first search
Objectives
- Breadth-first and depth-first search
- Shortest paths: Dijkstra's algorithm (introduction)
- Matchings and Hall's marriage theorem (statement)
- Vertex and edge colorings; chromatic number
- Ramsey theory (introduction)
Study materials
- Practice testComing soon