Question

3. Graph - Elementary Algorithms (30pts) 3.a Given the graph $G_s$ in Fig. 1, run the DFS algorithm from your STARTING NODE D and redraw the graph with the discovery time and the finishing time for each node. (15pts) 3.b. Find all strongly connected components in $G_s$ and draw the $G_s^{-1}$ with the finishing time for each node(15pts) B 12 H 8 15 17 2 F A 13 C 6 7 1 16 11 3 E 9 G 18 5 10 14 D 99 Fig. 1: Graph $G_s$ I

          3. Graph - Elementary Algorithms (30pts)
3.a Given the graph $G_s$ in Fig. 1, run the DFS algorithm from your STARTING NODE D and
redraw the graph with the discovery time and the finishing time for each node. (15pts)
3.b. Find all strongly connected components in $G_s$ and draw the $G_s^{-1}$ with the finishing time for
each node(15pts)
B
12
H
8
15
17
2
F
A
13
C
6
7
1
16
11
3
E
9
G
18
5
10
14
D
99
Fig. 1: Graph $G_s$
I

3. Graph - Elementary Algorithms (30pts)
3.a Given the graph Gs in Fig. 1, run the DFS algorithm from your STARTING NODE D and
redraw the graph with the discovery time and the finishing time for each node. (15pts)
3.b. Find all strongly connected components in Gs and draw the Gs^-1 with the finishing time for
each node(15pts)
B
12
H
8
15
17
2
F
A
13
C
6
7
1
16
11
3
E
9
G
18
5
10
14
D
99
Fig. 1: Graph Gs
I

Added by Anthony B.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Aishwarya Krishnakumar

Step 1

Set a counter to 1 which will be used to track discovery and finishing times. Create a stack for DFS and mark D as discovered with discovery time 1. Show more…

Show all steps

Thanks for your feedback!

3. Graph - Elementary Algorithms (30pts) 3.a Given the graph Gs in Fig. 1, run the DFS algorithm from your STARTING NODE D and redraw the graph with the discovery time and the finishing time for each node. (15pts) 3.b. Find all strongly connected components in Gs and draw the Gs-1 with the finishing time for each node (15pts) Fig.1: Graph Gs