noncomputable def
SimpleGraph.cycleRank
{α : Type u_1}
[Fintype α]
[DecidableEq α]
(G : SimpleGraph α)
[DecidableRel G.Adj]
:
The cycle rank of G (or cyclomatic number) is the minimum number of edges
that must be removed to eliminate all cycles.