GraphLab

Graph theory & algorithm visualizer
About Reachable sets

GraphLab › Reachable sets

Reachable Set of a Vertex in a Directed Graph: Step by Step

The reachable set R(v) of a vertex v is the set of all vertices you can get to from v by following edges in their direction. Every vertex reaches itself, so v is always in R(v).

Why it matters

Reachable sets answer questions such as "can this task be reached from that one?" They are the first step for finding strong components and the node base of a directed graph. If R(v) contains every vertex, v can reach the whole graph.

Try it in GraphLab

Each step takes one vertex, highlights the vertices it reaches and the edges used to reach them, and adds a row to the table. The last step shows the reachable sets of all vertices together.

More topics