Walk
Summary
A walk in a graph is a sequence of vertices in which consecutive vertices are adjacent. Walks are the basic notion of movement in a graph, and trails, paths, circuits and cycles are special walks. The node walk gives the precise definition.
What this node needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
Sources
- Web https://en.wikipedia.org/wiki/Path_(graph_theory), Walk, trail, and path
What links here
Definitions
- Walk 0VJZM0F9YM