G = digraph E
G = digraph H
G = digraph (V, E)
G = digraph (V, A)
G = digraph A
A digraph is a set of vertices connected by directed edges. Unlike the case with simple graphs, {u,v} being an edge does not imply that {v,u} is also an edge. Notably, this allows for nonsymmetric adjacency matrices.





The object digraph is a method function with options.