Length of shortest walk always equal to length of shortest path in an undirected graph?

discrete-mathematics graph-theory

The two definitions are equivalent, because for every walk between $u$ and $v$, there exists a path between $u$ and $v$, and the length of the path is equal to or smaller than the length of the walk.

Related

Definition of zeroth homology
Show that $\pi: \mathbb S^{2n+1} \to \mathbb {CP}^{n}$ is a bundle of fibre $\mathbb S^1$?
Is continuity required in order to show that a function satisfying $f(x+y)=f(x)+f(y)$ is of the form $f(x)=cx$? [duplicate]
Quick question about solutions to a question concerning quotient ring isomorphism [duplicate]
what does "It chooses a basis close to the starting basis but has no guarantee of choosing the closest orthonormal basis."mean? [closed]
Prove that functions $\phi$ that are zero except on some finite subset of $A$ are dense in $\ell^2(A)$
Better Honeypot Implementation (Form Anti-Spam)
Namespaces in C
How does one target IE7 and IE8 with valid CSS?
Comparison of XSD Code Generators [closed]
JSON.net ContractResolver vs. JsonConverter
How do I animate View.setVisibility(GONE)