Groups
Category
Johnson's Algorithm computes all-pairs shortest paths on sparse graphs by first removing negative edges via reweighting, then running Dijkstra from every vertex.
Centroid decomposition splits a tree into levels by repeatedly removing a centroid so that each remaining component is at most half the size.