Concepts3
⚙️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
Hungarian Algorithm
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.
#hungarian algorithm#assignment problem#bipartite matching+11
⚙️AlgorithmAdvanced
Minimum Cost Maximum Flow
Minimum Cost Maximum Flow (MCMF) finds the maximum possible flow from a source to a sink while minimizing the total cost paid per unit of flow along edges.
#minimum cost maximum flow#successive shortest augmenting path#reduced cost+11