GATE | GATE-CS-2014-(Set-1) | Question 13
Let G=(V,E) be a directed graph where V is the set of vertices and E the set of edges. Then which one of the following graphs has the same strongly connected components as G ?
Explanation: If we reverse directions of all arcs in a graph, the new graph has same set of strongly connected components as the original graph. Se https://www.geeksforgeeks.org/strongly-connected-components/ for more details.
Quiz of this Question