A directed graph, or digraph, represents connections with arrows: each edge runs from a source vertex to a destination vertex. Unlike a mutual connection, an arrow does not imply a return path. section 1.4.5
A one-way follow
If A follows B, A’s adjacency list includes B. B’s list stays empty unless B follows someone too. A traversal from A must follow the arrow’s direction. section 1.4.5
Figure 1.13 Two structural variations of a graph. Left: An Undirected Graph maps mutual, bidirectional connections. Right: A Directed Graph restricts travel paths to be unidirectional, forcing algorithms to explore a path based on direction.
Compare mutual, bidirectional connections with one-way paths that constrain traversal. section 1.4.5




