fact: Definition edge_spanning_tree (g1 : Graph) (e : E) (g2 : Graph) : Prop := if node_pred_dec (marked g1) (dst g1 e) then gremove_edge g1 e g2 /\ forall v, marked g1 v <-> marked g2 v else spanning_tree g1 (dst g1 e) g2.
imports: Coq.Classes.Morphisms CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.EnumEnsembles CertiGraph.lib.List_ext CertiGraph.lib.relation_list CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.graph_gen CertiGraph.graph.graph_relation CertiGraph.graph.subgraph2 CertiGraph.graph.reachable_ind Coq.Logic.Classical