|
GraphTheory[Digraph]
|
|
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
|
-
|
one of weighted or unweighted, or an equation weighted=true or false (optional)
|
|
|
|
|
|
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 may be found in the Graph help page.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
![G := Digraph({[1, 2], [2, 3], [3, 4], [4, 1]})](/support/helpjp/helpview.aspx?si=6007/file01796/math123.png)
|
|
| (1) |
|
>
|
|
|
>
|
|
|
>
|
|
|
| (2) |
|
>
|
|
|
| (3) |
|
>
|
![G := Digraph([{2}, {3}, {4}, {1}])](/support/helpjp/helpview.aspx?si=6007/file01796/math162.png)
|
|
| (4) |
|
>
|
|
|
![{[1, 2], [2, 3], [3, 4], [4, 1]}](/support/helpjp/helpview.aspx?si=6007/file01796/math172.png)
| (5) |
|
>
|
![V := [a, b, c, d]](/support/helpjp/helpview.aspx?si=6007/file01796/math176.png)
|
|
>
|
![E := {[[a, b], 1.0], [[a, c], 2.3], [[b, d], 3.1], [[c, d], 4]}](/support/helpjp/helpview.aspx?si=6007/file01796/math180.png)
|
|
>
|
|
|
| (6) |
|
>
|
|
|
>
|
|
|
| (7) |
|
>
|
|
|
| (8) |
|
>
|
|
|
>
|
|
|
![{[a, b], [a, c], [b, d], [c, d]}](/support/helpjp/helpview.aspx?si=6007/file01796/math226.png)
| (9) |
|
>
|
|
|
![Matrix([[0, 1.0, 2.3, 0], [0, 0, 0, 3.1], [0, 0, 0, 4], [0, 0, 0, 0]])](/support/helpjp/helpview.aspx?si=6007/file01796/math233.png)
| (10) |
|
|
Download Help Document
Was this information helpful?
