proposition: Lemma listEdges'_Permutation_rev: forall l, Permutation (listEdges' l) (listEdges' (rev l)).
proof: Proof. induction l; simpl. - apply perm_nil. - destruct a. simpl. rewrite listEdges'_app. simpl. rewrite IHl. apply Permutation_cons_append. Qed.
imports: Coq.Classes.Morphisms Coq.micromega.Lia Coq.Logic.FunctionalExtensionality CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.EnumEnsembles CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.graph_gen CertiGraph.graph.FiniteGraph