Definition:Reachable/Definition 2

From ProofWiki
Jump to navigation Jump to search

Definition

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

Let $\mathcal R$ be the reachability relation of $G$.

That is, $\mathcal R$ is the transitive closure of $A$.

Let $u, v \in V$.


Then $v$ is reachable from $u$ if and only if $u \mathrel {\mathcal R} v$.


Also see


Sources