Directed graph

From Simple English Wikipedia, the free encyclopedia
Jump to navigation Jump to search
A directed graph, vertex D cannot be reached from vertex B.

In graph theory, a directed graph is a graph which has edges which can only be travelled in one direction.