July 2018
Beginner
202 pages
5h 4m
English
Scenario
Improve Floyd-Warshall's algorithm so that we're able to reconstruct the shortest path between two given nodes after running the algorithm, using the predecessor matrix.
Aim
To construct a shortest path between the two vertices using the predecessor matrix.
Prerequisite
Read now
Unlock full access