Topic
walk.
sequence of edges connecting a sequence of vertices in a graph, possibly with repeated vertices and/or edges
The journal
Open the journal →The conversation starts in the journal — be the first to post.
About walk
In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct. A directed path in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction.
Everything about walk →