GraphTheory
IncidentEdges
find graph edges incident on a vertex
Calling Sequence
Parameters
Description
Examples
IncidentEdges(G, V, d)
G
-
graph or digraph
V
vertex or list of vertices
d
(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.
See Also
AdjacencyMatrix
Degree
IncidenceMatrix
Neighbors
Trail
Download Help Document