Girth of a simple graph #
This file defines the girth of a simple graph as the length of its smallest cycle, or ∞
if the
graph is acyclic.
The girth of a simple graph is the length of its smallest cycle, or ∞
if the graph is acyclic.
Equations
- G.girth = ⨅ (a : α), ⨅ (w : G.Walk a a), ⨅ (_ : w.IsCycle), ↑w.length
Instances For
@[simp]
@[simp]
Alias of the reverse direction of SimpleGraph.girth_eq_top
.