6. (a) Show that it is possible to partition a directed graph into strongly connected components. In particular show tha

[answerhappygod]

6 A Show That It Is Possible To Partition A Directed Graph Into Strongly Connected Components In Particular Show Tha 1 (43.24 KiB) Viewed 115 times

6. (a) Show that it is possible to partition a directed graph into strongly connected components. In particular show that if Vi is a strongly connected set of nodes, 12 is a strongly connected set of nodes, and V1, V, have at least one common node, then the union of Vi and V2 is also strongly connected. (b) By treating each strongly connected component as one big node, how can you depict the connections between the components by a directed acylic graph? It is easier to explain with a simple graph illustration. What does the edges here signify? (c) By taking the largest strongly connected component as the "core", can you relate the directed acylic graph with the "IN", "OUT" and "dendrites" set of nodes as given in Topic 2 Slide 13?