DT Q8
- Option : B
- Explanation : A graph is said to be strongly connected if there is path from each vertex of graph to every other vertex means every vertex is reachable from every other vertex. The strongly connected component is always maximal that is if A is strongly connected component there should not exist another strongly connected component which contains A
You must be logged in to post a comment.
You must be logged in to post a comment.