If a graph contains only directed edges, then the graph is known as a directed graph. A directed graph is also known as a digraph or a directed network. The following diagram represents a directed graph. Here, the (A, B), (B, C), (C, E), (E, D), (E, F), and (D, B) edges are directed edges. Since the edges are directed, edge AB is not the same as edge BA: