Concepts2
⚙️AlgorithmAdvanced
Directed MST (Edmonds/Chu-Liu Algorithm)
A directed minimum spanning arborescence (MSA) is a minimum-cost set of edges that makes every vertex reachable from a chosen root with exactly one incoming edge per non-root vertex.
#directed mst#edmonds algorithm#chu-liu+11
⚙️AlgorithmAdvanced
Johnson's Algorithm
Johnson's Algorithm computes all-pairs shortest paths on sparse graphs by first removing negative edges via reweighting, then running Dijkstra from every vertex.
#johnson's algorithm#all pairs shortest paths#apsp+12