DirectedGraph
gives a directed graph from the undirected graph g.
DirectedGraph[g,conv]
gives a directed graph using the conversion conv.
DirectedGraph[{vw,…},…]
uses rules vw to specify the graph g.
Details and Options

- DirectedGraph[g] is equivalent to DirectedGraph[g,Automatic].
- The following conversions conv can be used:
-
Automatic convert to both
and
"Acyclic" convert to
if u precedes v in the vertex list and
otherwise
"Random" convert to either
or
randomly
- DirectedGraph takes the same options as Graph.
- DirectedGraph works with undirected graphs, multigraphs, and mixed graphs.
Examples
open allclose allBasic Examples (3)
Scope (6)
The input is unchanged for directed graphs:
DirectedGraph works with undirected graphs:
Use rules to specify the graph:
DirectedGraph works with large graphs:
Applications (1)
Properties & Relations (3)
A directed graph can be constructed by a list of DirectedEdge objects:
A graph is either undirected or directed:
A nonsymmetric adjacency matrix is interpreted to be a directed graph:
Use DirectedEdges->False to interpret it as an undirected graph:
Text
Wolfram Research (2010), DirectedGraph, Wolfram Language function, https://reference.wolfram.com/language/ref/DirectedGraph.html (updated 2015).
CMS
Wolfram Language. 2010. "DirectedGraph." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/DirectedGraph.html.
APA
Wolfram Language. (2010). DirectedGraph. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/DirectedGraph.html