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.
Where this leads
1 page builds on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Path_(graph_theory), Walk, trail, and path
About this page
| Tag | 085CH3CYMX |
|---|---|
| URI | m2://085CH3CYMX |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05C38 |
Markdown · JSON · Edit on GitHub
What this page 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 page is. They do not measure its truth.