Version: 0.3.38
2. Reachability & Shortest Paths#
- Lecture:
Lecture 6.2
(slides)- Objectives:
Understand how to find the shortest paths in a graph
- Concepts:
Dijsktra’s algorithm, Bellman-Ford algorithm, Floyd-Warshall algorithm
To be completed
Hi there! What do you think of this course, so far? Please, give us feedback!