GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/IncidentEdges

GraphTheory

  

IncidentEdges

 

Calling Sequence

Parameters

Description

Examples

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

withGraphTheory:

GCycleGraph7

GGraph 1: an undirected unweighted graph with 7 vertices and 7 edge(s)

(1)

IncidentEdgesG,1

1,2,1,7

(2)

IncidentEdgesG,1,5,7

1,2,1,7,4,5,5,6,6,7

(3)

DGDigraphTrail1,2,3,4,5,3,Trail1,5,2,4,1

DGGraph 2: a directed unweighted graph with 5 vertices and 9 arc(s)

(4)

IncidentEdgesDG,2,3

2,3,2,4,3,4

(5)

IncidentEdgesDG,2,3,direction=incoming

1,2,2,3,5,2,5,3

(6)

See Also

AdjacencyMatrix

Degree

IncidenceMatrix

Neighbors

Trail