GraphTheory - Maple Help

Online Help

All Products    Maple    MapleSim


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

GraphTheory

  

Digraph

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

Digraph(V)

Digraph(L)

Digraph(V, L)

Digraph(V, E, A, W)

Parameters

V

-

list of vertices or number of vertices

E

-

set of arcs

L

-

Array or list of sets of vertices indicating vertex neighbors

A

-

adjacency Matrix (edge weights)

W

-

(optional) one of weighted or unweighted, or an equation weighted=true or false

Description

• 

The Digraph command creates a digraph (directed graph) with the given parameters. The input parameters may appear in any order; however, they must be compatible.

• 

A detailed description of the meaning of each parameter is found in the Graph help page.

Examples

withGraphTheory:

GDigraph1,2,2,3,3,4,4,1

G:=Graph 1: a directed unweighted graph with 4 vertices and 4 arc(s)

(1)

DrawGraphG

DrawGraphG,style=circle

IsDirectedG

true

(2)

IsStronglyConnectedG

true

(3)

GDigraph2,3,4,1

G:=Graph 2: a directed unweighted graph with 4 vertices and 4 arc(s)

(4)

EdgesG

1,2,2,3,3,4,4,1

(5)

Va,b,c,d:

Ea,b,1.0,a,c,2.3,b,d,3.1,c,d,4:

GDigraphV,E

G:=Graph 3: a directed weighted graph with 4 vertices and 4 arc(s)

(6)

DrawGraphG

IsStronglyConnectedG

false

(7)

IsNetworkG

a,d

(8)

DrawNetworkG

EdgesG

a,b,a,c,b,d,c,d

(9)

WeightMatrixG

01.02.300003.100040000

(10)

See Also

DrawGraph

DrawNetwork

Edges

Graph

RandomGraphs[RandomDigraph]

Vertices

 


Download Help Document

Was this information helpful?



Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam