See the hand-written lecture notes in the Engineering LibraryAll-pairs shortest paths
- find all connected pairs of nodes - motivating example: connectivity in a network - variant: Floyd's shortest path algorithm - motivating example: "upper bound on transmission time"Single-source shortest path
- Dijkstra's alg: all shortest paths from a source node - motivating example: "Erdos number"