Breadth-First Search (BFS), Application: Shortest Paths, Application: Undirected Connectivity Depth-First Search, Application: Topological Sort Strongly Connected Components(SCC), Kosaraju’s Two‐Pass ...