noncomputable def SimpleGraph.circumference {α : Type u_1} (G : SimpleGraph α) [DecidableRel G.Adj] : ℕ

circumference G is the length of the longest cycle in G. It is 0 when G is acyclic.

Equations

• G.circumference = sSup {n : ℕ | ∃ (a : α) (w : G.Walk a a), w.IsCycle ∧ w.length = n}