In Lecture 18, Gusfield discusses Floyd-Warshall, the algorithm for computing the shortest path in a weighted graph between each pair of nodes in the graph.

Floyd-Warshall algorithm for all-pairs shortest path

The purpose of this undergraduate course is to introduce fundamental techniques and viewpoints for the design and the analysis of efficient computer algorithms, and to study important specific algorithms. The course relies heavily on mathematics and mathematical thinking in two ways: first as a way of proving properties about particular algorithms such as termination, and correctness; and second, as a way of establishing bounds on the worst case (or average case) use of some resource, usually time, by a specific algorithm. The course covers some randomized algorithms as well as deterministic algorithms.

Share Floyd-Warshall algorithm for all-pairs shortest path

Sign up to save your podcasts

Floyd-Warshall algorithm for all-pairs shortest path

Floyd-Warshall algorithm for all-pairs shortest path