Directed graph

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.