powered by
This function is similar to neighbors, but it queries the adjacent vertices for multiple vertices at once.
neighbors
adjacent_vertices(graph, v, mode = c("out", "in", "all", "total"))
A list of vertex sequences.
Input graph.
The vertices to query.
Whether to query outgoing (‘out’), incoming (‘in’) edges, or both types (‘all’). This is ignored for undirected graphs.
Other structural queries: [.igraph(), [[.igraph(), are_adjacent(), ends(), get.edge.ids(), gorder(), gsize(), head_of(), incident_edges(), incident(), is_directed(), neighbors(), tail_of()
[.igraph()
[[.igraph()
are_adjacent()
ends()
get.edge.ids()
gorder()
gsize()
head_of()
incident_edges()
incident()
is_directed()
neighbors()
tail_of()
g <- make_graph("Zachary") adjacent_vertices(g, c(1, 34))
Run the code above in your browser using DataLab