Online Help

The opts parameter is used to specify one or more additional properties of the graph.

weighted or weighted=true

Specifies that this graph has weighted edges.

unweighted or weighted=false

Specifies that this graph has no edge weights.

edgelabels=e

Specifies labels for the edges for use with DrawGraph . The value is a set of equations in which the left-hand side of each equation is an edge and the right-hand side is a string specifying the desired label.

Each edge must be expressed as a list of vertices if the graph is directed and as a set of vertices if it is undirected.

The default is the empty set.

selfloops=truefalse

Specifies whether self-loops should be permitted in the graph. If false, an error will be issued if the edge information provided with parameters E, L, T, or A contains a self-loop. The default is true.

vertexcolor=c

Specifies a color or list of colors to associate with the vertices in vertex order.

vertexlabels=p

Specifies labels for the vertices for use with DrawGraph .

vertexpositions=p

Specifies coordinate positions for the vertices for use with DrawGraph .

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.

$\mathrm{with}\left(\mathrm{GraphTheory}\right)\:$

$G≔\mathrm{Digraph}\left(\left\{\left[1\,2\right]\,\left[2\,3\right]\,\left[3\,4\right]\,\left[4\,1\right]\right\}\right)$

$G≔\mathrm{Graph\; 1:\; a\; directed\; graph\; with\; 4\; vertices\; and\; 4\; arcs}$

$\mathrm{DrawGraph}\left(G\right)$

$\mathrm{DrawGraph}\left(G\,\mathrm{style}=\mathrm{circle}\right)$

$\mathrm{IsDirected}\left(G\right)$

$\mathrm{true}$

$\mathrm{IsStronglyConnected}\left(G\right)$

$\mathrm{true}$

$G≔\mathrm{Digraph}\left(\left[\left\{2\right\}\,\left\{3\right\}\,\left\{4\right\}\,\left\{1\right\}\right]\right)$

$G≔\mathrm{Graph\; 2:\; a\; directed\; graph\; with\; 4\; vertices\; and\; 4\; arcs}$

$\mathrm{Edges}\left(G\right)$

$\left\{\left[1\,2\right]\,\left[2\,3\right]\,\left[3\,4\right]\,\left[4\,1\right]\right\}$

$V≔\left[a\,b\,c\,d\right]\:$

$E≔\left\{\left[\left[a\,b\right]\,1.0\right]\,\left[\left[a\,c\right]\,2.3\right]\,\left[\left[b\,d\right]\,3.1\right]\,\left[\left[c\,d\right]\,4\right]\right\}\:$

$G≔\mathrm{Digraph}\left(V\,E\right)$

$G≔\mathrm{Graph\; 3:\; a\; directed\; weighted\; graph\; with\; 4\; vertices\; and\; 4\; arcs}$

$\mathrm{DrawGraph}\left(G\right)$

$\mathrm{IsStronglyConnected}\left(G\right)$

$\mathrm{false}$

$\mathrm{IsNetwork}\left(G\right)$

$\left\{a\right\},\left\{d\right\}$

$\mathrm{DrawNetwork}\left(G\right)$

$\mathrm{Edges}\left(G\right)$

$\left\{\left[a\,b\right]\,\left[a\,c\right]\,\left[b\,d\right]\,\left[c\,d\right]\right\}$

$\mathrm{WeightMatrix}\left(G\right)$

$\left[\begin{array}{cccc}0& 1.0& 2.3& 0\\ 0& 0& 0& 3.1\\ 0& 0& 0& 4\\ 0& 0& 0& 0\end{array}\right]$

The selfloops option was introduced in Maple 2020.

For more information on Maple 2020 changes, see Updates in Maple 2020 .

The GraphTheory[Digraph] command was updated in Maple 2025.

The edgelabels and vertexlabels options were introduced in Maple 2025.

For more information on Maple 2025 changes, see Updates in Maple 2025 .