Rooted directed graph
= Rooted directed graph
{title2=$(G,E,r_G)$}
A rooted directed graph has a distinguished root. Root-connectedness means each vertex can be reached by a finite directed path from that root. This is directed reachability, rather than connectedness of the underlying undirected graph.