Example:
Walk = (A,B), (B,C), (C,D)
I.e.: path = visit a vertex at most once
length of path = 3 + 4 + 2 = 9
length of the shortest path = 2 + 6 = 8