Directed Graphs. Given vertices u and v of a digraph G , we say that u reaches v (and v is reachable from u ) if G has a directed path from u to.
