determine all vertices reachable from a given vertex
vertex of the graph
Reachable returns a list of all vertices reachable from the vertex u in the graph G.
A vertex v is said to be reachable from a vertex u if there exists a path in the graph from u to v.
To produce an actual spanning tree of vertices reachable from u, see SpanningTree or MinimalSpanningTree.
C6 ≔ CycleGraph⁡6
C6≔Graph 1: an undirected unweighted graph with 6 vertices and 6 edge(s)
G ≔ Graph⁡5,1,2,2,3,1,4,4,5
G≔Graph 2: a directed unweighted graph with 5 vertices and 6 arc(s)
The GraphTheory[Reachable] command was introduced in Maple 2018.
For more information on Maple 2018 changes, see Updates in Maple 2018.
Download Help Document
What kind of issue would you like to report? (Optional)