Finds all vertices reachable from a given vertex, or the opposite: all vertices from which a given vertex is reachable via a directed path.
subcomponent(graph, v, mode = c("all", "out", "in"))The graph to analyze.
The vertex to start the search from.
Character string, either “in”, “out” or
“all”. If “in” all vertices from which v is reachable
are listed. If “out” all vertices reachable from v are
returned. If “all” returns the union of these. It is ignored for
undirected graphs.
Numeric vector, the ids of the vertices in the same component as
v.
A breadth-first search is conducted starting from vertex v.
Other structural.properties:
bfs(),
component_distribution(),
connect(),
constraint(),
coreness(),
degree(),
dfs(),
distance_table(),
edge_density(),
feedback_arc_set(),
girth(),
is_acyclic(),
is_dag(),
is_matching(),
k_shortest_paths(),
knn(),
reciprocity(),
subgraph(),
topo_sort(),
transitivity(),
unfold_tree(),
which_multiple(),
which_mutual()
g <- sample_gnp(100, 1 / 200)
subcomponent(g, 1, "in")
#> + 1/100 vertex, from 71fe4f2:
#> [1] 1
subcomponent(g, 1, "out")
#> + 1/100 vertex, from 71fe4f2:
#> [1] 1
subcomponent(g, 1, "all")
#> + 1/100 vertex, from 71fe4f2:
#> [1] 1