We can de?ne the root .9 of a directed graph G = (V, E) as the node from which every other node is reachable. In other words, V v E V there is a path from s to 1). Assume that C does not contain