Directed Graph

Directed Graph

Graph in which each edge connecting two vertices is directed (has a sense).

The edges of a directed graph are called arcs.


This is a directed graph, because each arc is directed.


On a map, the city street plan is generally represented by an undirected graph. However, if there are several one-way streets, the graph representing this city will look like a directed graph.

Try Buzzmath activities for free

and see how the platform can help you.