proposition: Lemma spanning_tree_is_componded_mark: forall root x g1 g2, spanning_tree g1 x g2 -> componded root (mark x) g1 g2.
proof: Proof. intros. apply mark_is_componded_mark. intros. destruct H as [? [? _]]. split; auto. Qed.
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