Definition:Reachable/Definition 1

From ProofWiki
Jump to navigation Jump to search

Definition

Let $G = \left({V, A}\right)$ be a directed graph.

Let $u, v \in V$.


Then $v$ is reachable from $u$ if and only if there exists a directed walk from $u$ to $v$.


Also see


Sources