ConceptTheory & Algos
Johnson's algorithm
An algorithm that solves the all-pairs shortest path problem in sparse graphs with arbitrary edge weights in time comparable to running Dijkstra V times.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
6The lectures that define it or assume it, and the concepts next to it.