Graph Theory: 18. Every Walk Contains a Path
Here I show a proof that every walk in a graph contains a path. This is why we can define connected graphs as those graphs for which there is a path between every pair of vertices.
--An introduction to Graph Theory by Dr. Sarada Herke.
For quick videos about Math tips and useful facts, check out my other channel
"Spoonful of Maths" - / spoonfulofmaths