fact: Fixpoint find_list (bound: nat) (v: Vertex) (l: list Edge) : list Edge := let next := (dst g (out_edge v)) in if (projT2 is_null) next then rev l else match bound with | O => rev l | S n => find_list n next (out_edge v :: l) end.
imports: CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.lib.Ensembles_ext CertiGraph.lib.EnumEnsembles CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.graph_gen CertiGraph.graph.MathGraph CertiGraph.graph.LstGraph CertiGraph.graph.FiniteGraph CertiGraph.graph.reachable_computable