Too Long; Didn't Read
Shortest and Longest Path Algorithms: Job Interview Cheatsheet is a quick overview and comparison of shortest and longest path algorithms in graphs. Questions on this topic are very common in technical job interviews for computer programmers. The Shortest Distance problem only requires the shortest distance between nodes, whereas the Shortest Path Problem requires the actual shortest path between nodes. The shortest path can usually be found with minor enhancement in the algorithm. Floyd-Warshall is the simplest algorithm: We calculate the shortest possible path from node i to j.