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
⚙️AlgorithmIntermediate
Euler Path and Circuit
An Euler path visits every edge exactly once, and an Euler circuit is an Euler path that starts and ends at the same vertex.
#euler path#euler circuit#hierholzer algorithm+12