DS and Algorithms (GATE 2014 set 1 QUESTION 1)

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? #Gatecs2014QNA #Datastructure #Algorithms #Appliedcourse #gatecse #Computerscience Please visit: https://gate.appliedroots.com/ For any queries you can either drop a mail to [email protected] or call us at +91 844-844-0102