Reachability
Same method as for undirected graphs.
• Every undirected graph is a digraph (with edges in both directions).
• DFS is a digraph algorithm.
Paste_Image.png
To be continued. (Stay tuned)
Reachability
Same method as for undirected graphs.
• Every undirected graph is a digraph (with edges in both directions).
• DFS is a digraph algorithm.
To be continued. (Stay tuned)