| 释义 |
walk (in graph theory) The general name given to a sequence of adjacent edges in a graph. A walk in which no edge is repeated is a trail, and if no vertex is revisited in a trail, it is a path. The special case where the path starts and finishes at the same vertex is an exception to this and is termed a cycle.
|