Definition
A path in a Graph is a sequence of vertices and edges connecting two endpoints. In a Directed Graph, a path must follow outgoing edges only.
Properties
A path may visit the same vertex multiple times unless otherwise specified. When vertices are not repeated, the path is called simple.
The length of a path is the number of edges it contains.
Related Concepts
- Cycle: A path that starts and ends at the same vertex
- Tree: A graph where exactly one path exists between any two vertices
- Directed Acyclic Graph: A directed graph where no directed paths form cycles