Question

Problem 1 (15 points) Apply STRONGLY-CONNECTED-COMPONENTS algorithm to the graph below to identify its connected components and the nodes within each component. You need to show all the intermediate steps. STRONGLY-CONNECTED-COMPONENTS (G) 1. Call DFS (G) to compute finishing times $f(u)$ for each vertex $u$ 2. Compute $G^T$ 3. Call DFS ($G^T$), but in the main loop of DFS, consider the vertices in order of decreasing $f(u)$ 4. Output the vertices of each tree in the depth-first forest formed in line 3 as a separate strongly connected component Start at node a In case there are multiple adjacent nodes, follow the alphabetical order. a b c d e f g h

          Problem 1 (15 points)
Apply STRONGLY-CONNECTED-COMPONENTS algorithm to the graph below to identify its connected
components and the nodes within each component. You need to show all the intermediate steps.
STRONGLY-CONNECTED-COMPONENTS (G)
1. Call DFS (G) to compute finishing times $f(u)$ for each vertex $u$
2. Compute $G^T$
3. Call DFS ($G^T$), but in the main loop of DFS, consider the vertices in order of decreasing $f(u)$
4. Output the vertices of each tree in the depth-first forest formed in line 3 as a separate strongly connected component
Start at node a
In case there are multiple adjacent nodes, follow the alphabetical order.
a
b
c
d
e
f
g
h

Problem 1 (15 points)
Apply STRONGLY-CONNECTED-COMPONENTS algorithm to the graph below to identify its connected
components and the nodes within each component. You need to show all the intermediate steps.
STRONGLY-CONNECTED-COMPONENTS (G)
1. Call DFS (G) to compute finishing times f(u) for each vertex u
2. Compute G^T
3. Call DFS (G^T), but in the main loop of DFS, consider the vertices in order of decreasing f(u)
4. Output the vertices of each tree in the depth-first forest formed in line 3 as a separate strongly connected component
Start at node a
In case there are multiple adjacent nodes, follow the alphabetical order.
a
b
c
d
e
f
g
h

Added by Francisco Javier B.

Question

Please give Ace some feedback