Groups
Category
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.
The Hungarian algorithm solves the square assignment problem (matching n workers to n jobs) in O(n^{3}) time using a clever potential (label) function on vertices.