proposition: Lemma mark_marked_root_refl: forall (g: Graph) root, marked g root -> mark root g g.
proof: Proof. intros. split. + reflexivity. + intros. pose proof reachable_by_head_prop g root n (unmarked g). unfold unmarked at 2 in H0; rewrite negateP_spec in H0. tauto. Qed.
imports: Coq.Logic.ProofIrrelevance Coq.Classes.Morphisms VST.msl.Coqlib2 CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.Relation_ext CertiGraph.lib.relation_list CertiGraph.lib.EnumEnsembles CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_computable CertiGraph.graph.reachable_ind CertiGraph.graph.graph_gen CertiGraph.graph.subgraph2 CertiGraph.graph.dual_graph