Strongly Connected Components
Q1. The task on our hand is to determine whether a graph contains cycle or not. Select the method you can use
Q2. Allan was using DFS on a tree, he used the same code on a graph but the results were not correct. What could be the reason?
Q3. What will be the order of traversal of nodes in DFS for the following graph starting from node 2? (Assume that the nodes are traversed in numerical order.)
Q4. What will be the order of traversal of nodes in BFS for the following graph starting from node 5? (Assume that the nodes are traversed in numerical order.)