01Which algorithm finds the shortest path in an UNWEIGHTED graph?
02Depth-First Search (DFS) is typically implemented using:
03What is 'Topological Sort'?
04Why is a 'Visited' set necessary for graph traversal?
05In DFS, a 'Back Edge' points to an ancestor, indicating:
06Which traversal is like a 'Ripple in a Pond'?
07The time complexity of both BFS and DFS is:
08Which traversal uses more memory for a very WIDE, shallow graph?
09In a DFS forest, what is a 'Cross Edge'?
10Iterative Deepening DFS (IDDFS) combines: