so in the first chapter , specifically the Paths in undirected graphs defined formally part i belive there is a mistake
under the following assumptions, we have an undirected graph G = (V, E) and an ordered list of directed edges P = (e1, e2, …, ek) , and the three condition of path , and we have given an
(w) example of a walk which is
- W = ((6, 4), (4, 3), (3, 2), (2, 5), (5, 3), (4, 3), (3, 2), (2, 5), (5,1)) is a walk from node 6 to node 1
the pair (5,3) is not an edge in E i belive … which means thats not a walk , or am I missing something ?