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.
An Euler path visits every edge exactly once, and an Euler circuit is an Euler path that starts and ends at the same vertex.