proposition: Corollary connected_exists_list_edges: forall g p u v, connected_by_path g p u v -> exists l, fits_upath g l p.
proof: Proof. intros. destruct H. apply valid_upath_exists_list_edges. apply H. Qed.
imports: Coq.Logic.Classical CertiGraph.lib.List_ext CertiGraph.lib.EquivDec_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_relation CertiGraph.graph.path_lemmas CertiGraph.graph.graph_gen CertiGraph.graph.FiniteGraph