Question

Data Structures/Automata/Graph Theory Question:

Problem 1 Find the strongly connected components of the graph shown on Figure1 Figure 1:

Answer 1

There are 5 strongly connected component in given graph.

A strongly connected component it a subgraph of graph in which all pair are connected to each other i.e. traversal can be done from any node to all other nodes. Any node which don't fall under any such subgraph is distinctely an another strongly connected component for that graph.

As you can see in component 1 and 2, all node are reachable by other nodes, but there is no way to reach B and E. A is node where can be reached only by B or E but they are distinct in theirself. So these 3 node are strongly connected component itself. So there are total 5 strongly connected component.

There are 5 strongly connected component in given graph. A strongly connected component it a subgraph of graph in which all pair are connected to each other i.e. traversal can be done from any node to all other nodes. Any node which don't fall under any such subgraph is distinctely an another strongly connected component for that graph. As you can see in component 1 and 2, all node are reachable by other nodes, but there is no way to reach B and E. A is node where can be reached only by B or E but they are distinct in theirself. So these 3 node are strongly connected component itself. So there are total 5 strongly connected component.

//Your feedback is important to us. In case you have any doubt please let me know in comment section so I can clear that out.

//Please upvote the answer to appreciate the efforts. Thank you!