Term for the set of all reachable vertices from a vertex in a directed graph

73 Views Asked by At

Let $G$ be a directed graph and let $v$ be a vertex. Let $R$ be the set of all vertices that are reachable from $v$. Is there a special name either for $R$ or for the subgraph induced by $R$ ?

If the graph was undirected, I guess what I am looking for would be the connected component which $v$ belongs to.