Directed Graphs (Digraphs) (cont)
Terminology for digraphs …
Directed path:
sequence of n ≥ 2 vertices v1 → v2 → … → vn
- where (vi,vi+1) ∈ edges(G) for all vi,vi+1 in sequence
- if v1 = vn, we have a directed cycle
Reachability:
w is reachable from v if ∃ directed path v,…,w
|
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}