powered by
Incident edges of a vertex in a graph
incident(graph, v, mode = c("all", "out", "in", "total"))
The input graph.
The vertex of which the incident edges are queried.
Whether to query outgoing (‘out’), incoming (‘in’) edges, or both types (‘all’). This is ignored for undirected graphs.
An edge sequence containing the incident edges of the input vertex.
Other structural queries: [.igraph(), [[.igraph(), adjacent_vertices(), are_adjacent(), ends(), get.edge.ids(), gorder(), gsize(), head_of(), incident_edges(), is_directed(), neighbors(), tail_of()
[.igraph()
[[.igraph()
adjacent_vertices()
are_adjacent()
ends()
get.edge.ids()
gorder()
gsize()
head_of()
incident_edges()
is_directed()
neighbors()
tail_of()
# NOT RUN { g <- make_graph("Zachary") incident(g, 1) incident(g, 34) # }
Run the code above in your browser using DataLab