proposition: Lemma weight_representable: forall (g: UAdjMatGG) e, Int.min_signed <= elabel g e <= Int.max_signed.
proof: Proof. intros. destruct (evalid_dec g e). apply (evalid_meaning g e); auto. rewrite (invalid_edge_weight g) in n. replace (elabel g e) with inf in * by trivial. pose proof (inf_representable g). rep_lia. Qed.
imports: VST.floyd.proofauto CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.lib.find_lemmas CertiGraph.graph.graph_model CertiGraph.graph.graph_gen CertiGraph.graph.graph_relation CertiGraph.graph.undirected_graph CertiGraph.graph.MathAdjMatGraph