fact: Definition dfs (from : V) : list V := let count := Npos (List.fold_left (fun acc _ => Pos.succ acc) (verticies g) 1%positive) in let res := runGFix (dfs' from nil) count in match res with | Diverge => verticies g | Term v => v end.
imports: Coq.Lists.List Coq.PArith.BinPos ExtLib.Structures.Monads ExtLib.Structures.Reducible ExtLib.Data.Graph.Graph ExtLib.Data.Monads.FuelMonad ExtLib.Data.Monads.IdentityMonad ExtLib.Data.List ExtLib.Core.RelDec