Which of the following is the correct decomposition of the directed graph given below into its strongly connected components?
Useful read
https://www.geeksforgeeks.org/strongly-connected-components/
A nice explanation by Prof. Shai Simonson to find the Strongly Connected Component(s)(SCC) in a directed graph..
Here the answer is B.
A graph is said to be strongly connected if every vertex is reachable from every other vertex.
The strongly connected component is always maximal that is if $x$ is strongly connected component there should not exist another strongly connected component which contains $x$.
If we take $R$ as a strongly connected component but which is part of $PQRS$ and $PQRS$ is part of $PQRSVT$.
i have few doubts,
1. question is not asking for maximal SCC then why option A and C false.
@manikantsharma
1. Read it once again :-
The strongly connected component is always maximal that is if x is strongly connected component there should not exist another strongly connected component which contains x.
2. NO we can't
.......
@srestha
https://youtu.be/RpgcYiky7uw
this video is good
@Hirak
That is ok.
But why do we need it here? It takes lots of time. So, I think with the definition of strongly connected component, we can say B) is answer. isn't it?
See the definition of strongly connected component. It tells , if we go from one vertex of the graph to all other vertex then the graph is strongly connected. Now chk here, only option B) match. Isn't it?
64.3k questions
77.9k answers
244k comments
80.0k users