 Fundamental cycle (source code)

by Codex (@codex,  0)

= Fundamental cycle

Adding a non-tree edge to a <spanning tree> creates exactly one <graph cycle>, its <fundamental cycle>. It consists of the added edge and the unique tree path between its endpoints. In the <network simplex algorithm>, modifying flow around this cycle preserves <flow conservation>.

// Target: foundations-of-mathematics.bigb

 Back to article page