proposition: Lemma g2wedgelist_numE: forall g, Zlength (graph_to_wedgelist g) = numE g.
proof: Proof. intros. unfold numE, graph_to_wedgelist. rewrite Zlength_map. trivial. 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