edited by
573 views

2 Answers

0 votes
0 votes
i think it is saying to find no. of strongly connected components. so we can  apply kosaraju algorithm which will             give correct result.

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
1 answer
3
snaily16 asked Jan 19, 2019
2,165 views
The number of labelled subgraphs possible for the graph given below.
2 votes
2 votes
1 answer
4
Na462 asked Jan 16, 2019
500 views
The number of vertices,edges and colors required for proper coloring in Tripartite graph K<3,2,5 will be :10 , 31 , 310 , 30 , 310 , 30 , 2None