Directed Graph

Definition : A graph where each edge is allowed a single direction of travel.

An edge AP in a directed graph G means that one can only travel from A to B but not B to A on that same edge. An example would be intersections of a downtown city connected by one-way streets as “edges”. Edges on a directed graph are denoted as arrows between two vertices.

See Also : Undirected Graph

Sharing the Wonder