Directed Graphs (Digraphs)
Digraphs are graphs where
edges are directional (
v → w ≠ w → v
)
can only "move" along an edge in the direction of the arrow
Example:
Traversal uses same algorithms as for non-directed graphs (DFS,BFS)
![[Diagram:Pics/graphs/digraph0.png]](Pics/graphs/digraph0.png)
![[prev]](icon/prev.gif){kind=icon}
![[index]](icon/up.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}