Question

3. Given a directed graph G < V E >, we define its transpose Gr < V.E1 > to be the graph such that ET-{ < v, u >:< u, v >EE). In other words, GT has the same number of edges as in G, but the directions of the edges are reversed. Draw the transpose of the following graph: ta Perform DFS on the original graph G, and write down the start and finish times for each vertex in the graph. Assume that the nodes are in alphabetical order and the adjacency list for each node is also in alphabetical order (the algorithm does not rely on the ordering, this is only for the convenience of checking your answer) tices in order of decreasing order the finish times computed earlier. For convenience, we again assume that the adjacency list for each node is also in alphabetical order. Draw all depth-first trees constructed in this DFS of G Consider all vertices from a depth-first tree, what can you say about the connectivity of these vertices in G? If you pick a vertex from a depth-first tree and another vertex from a different depth-first tree, you should not observe the same property.

Answer 1

bate Since Transpose of a dine ano ther raph with all edges reversed Solution in alphabetica! order and s0 is it's ad ncency ist, hers is what list will Lonk like alphabeicalby) So on stut nFinish time nod boe uoull choose @as starking node apkabeftreny

bfs om (a) 019 dts tree of a a. ALphabt hally we chose b fer DFS yam ee of 13 15

DFS on GT-(choosing no des assordintto decreasi 썅 order of nish time . So we choose b as startine nod e maode for bes n Cr C. 13 /14

-) noxture choose (a) as stunt hode (del teasing finish tuvu) , Des tree-w叫 8 미14- 215 bFs tree 4 No Comsider all vertices om DFS trce t we can easta See that oe bick 100 all pain of vertices sud set of trées is called a Strong Connected Cormpmont 2