proposition: Lemma path_ends_one_step: forall (g: AdjMatGG) a b, path_ends g (a, (a, b)::nil) a b.
proof: Proof. intros. split; trivial. simpl. rewrite (edge_dst_snd g); trivial. Qed.
imports: Coq.ZArith.BinInt Coq.Classes.EquivDec compcert.lib.Integers CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.FiniteGraph CertiGraph.graph.path_lemmas