This is documentation for Mathematica 8, which was
based on an earlier version of the Wolfram Language.

# DirectedGraph

 DirectedGraph[g] gives a directed graph from the undirected graph g. DirectedGraphgives a directed graph using the conversion conv.
• 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
Convert each undirected edge of the graph to both directions:
A random direction:
Convert each undirected edge of the graph to both directions:
 Out[1]=

A random direction:
 Out[1]=
 Scope   (3)
The input is unchanged for directed graphs:
DirectedGraph works with undirected graphs:
Works with large graphs:
 Applications   (1)
Find strongly connected components in a random directed grid graph:
Highlight the components of size greater than 1:
A directed graph can be constructed by a list of DirectedEdge objects:
A graph is either undirected or directed:
A non-symmetric adjacency matrix is interpreted to be a directed graph:
Use DirectedEdges->False to interpret it as an undirected graph:
New in 8