Definition:Directed Walk
Jump to navigation
Jump to search
This page is about directed walk in the context of graph theory. For other uses, see walk.
Definition
Let $G = \struct {V, A}$ be a digraph.
A directed walk in $G$ is a finite or infinite sequence $\sequence {x_k}$ such that:
- $\forall k \in \N: k + 1 \in \Dom {\sequence {x_k} }: \tuple {x_k, x_{k + 1} } \in A$
Sources
 | There are no source works cited for this page. Source citations are highly desirable, and mandatory for all definition pages. Definition pages whose content is wholly or partly unsourced are in danger of having such content deleted. To discuss this page in more detail, feel free to use the talk page. |