A path is a walk in which all vertices and edges are distinct.
Example of a walk that is not a path: Let's consider the hexagonal graph with vertices A, B, C, D, E, and F, and edges AB, BC, CD, DE, EF, and FA. A walk that is not a path could be A-B-C-D-E-F-A-B.
Show more…