|
GraphTheory[IncidentEdges]
|
|
Calling Sequence
|
|
IncidentEdges(G, V, d)
|
|
|
Parameters
|
|
|
G
|
-
|
graph or digraph
|
|
V
|
-
|
vertex or list of vertices
|
|
d
|
-
|
(optional) equation of the form direction=incoming or outgoing
|
|
|
|
|
|
Description
|
|
|
•
|
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.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
![IncidentEdges(G, [1, 5, 7])](/support/helpjp/helpview.aspx?si=6070/file01825/math100.png)
|
|
| (2) |
|
>
|
|
|
| (3) |
|
>
|
![IncidentEdges(DG, [2, 3])](/support/helpjp/helpview.aspx?si=6070/file01825/math114.png)
|
|
![{[2, 3], [2, 4], [3, 4]}](/support/helpjp/helpview.aspx?si=6070/file01825/math117.png)
| (4) |
|
>
|
![IncidentEdges(DG, [2, 3], direction = incoming)](/support/helpjp/helpview.aspx?si=6070/file01825/math121.png)
|
|
![{[1, 2], [2, 3], [5, 2], [5, 3]}](/support/helpjp/helpview.aspx?si=6070/file01825/math124.png)
| (5) |
|
|
Download Help Document
Was this information helpful?
