This unit covers the following single source shortest path algorithms:
- Breadth first search
- Dijkstra's algorithm
- Bellman-Ford
Complementary notes can be found in section 4.4 of the book Competitive Programming 3.
- Unit 1: Complexity
- Unit 2: Linear data structures
- Unit 4: Tree data structures (mainly heap)
- Unit 6: Graph representation
- Unit 12: Greedy (basic idea, used in dijkstra)
- Unit 14: Graph traversal (mainly BFS)
problems marked with (!) are recommended as beginning exercise
- UVa 314 - Robot
- UVa 336 - A Node Too Far
- (!) UVa 383 - Shipping Routes
- UVa 571 - Jugs
- UVa 949 - Getaway
- UVa 157 - Route Finding
- UVa 318 - Domino Effect
- UVa 1112 - Mice and Maze
- (!) UVa 10986 - Sending email