fact: Definition edge_copy (g: Graph) (root: V) (M: V -> Prop) (l: list E * E) := let (es_done, e0) := l in let M0 := Union _ M (eq root) in let PV1 := reachable_by_through_set g (map (dst g) es_done) (Complement _ M0) in let M_rec := Union _ M0 PV1 in relation_list (extended_copy M_rec (dst g e0) :: ecopy1 e0 :: nil).
imports: CertiGraph.lib.Coqlib CertiGraph.lib.Ensembles_ext CertiGraph.lib.EquivDec_ext CertiGraph.lib.relation_list CertiGraph.lib.Morphisms_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.graph_gen CertiGraph.graph.graph_relation CertiGraph.graph.subgraph2 CertiGraph.graph.graph_morphism