proposition: Lemma NoDup_g2wedgelist: forall g, NoDup (graph_to_wedgelist g).
proof: Proof. intros. apply FinFun.Injective_map_NoDup. unfold FinFun.Injective; intros. inversion H. auto. apply NoDup_EList. Qed.
imports: VST.floyd.proofauto CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen CertiGraph.graph.FiniteGraph CertiGraph.graph.undirected_graph