Path
Summary
A path in a graph is a walk that visits each vertex at most once. Paths measure distance and connectivity in graphs. The node path gives the precise definition.
What this node needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (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
- Path 0JDE56HWQ8