find graph edges incident on a vertex
IncidentEdges(G, V, d)
graph or digraph
vertex or list of vertices
(optional) equation of the form direction=incoming or outgoing
IncidentEdges returns the set of edges (arcs) which are incident to a given vertices. If G is a directed graph, then the set of arcs which have a tail in the given list of vertices are returned.
IncidentEdges(G, V, direction=incoming) returns the set of arcs which have a head in the given set of vertices.
G≔Graph 1: an undirected unweighted graph with 7 vertices and 7 edge(s)
DG≔Graph 2: a directed unweighted graph with 5 vertices and 9 arc(s)
Download Help Document
What kind of issue would you like to report? (Optional)