A walk is and ordered collection of edges in a graph for which the terminal node of one edge is the starting node of the next. We allow repeated edges.