• recategorized by
3,706 views
2 2 votes

 

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
0 0 answers
3.4k
3.4k views
syncronizing asked Sep 15, 2018
3,412 views
Consider the following graph:The number of strongly connected components of the graph are ________.
0 0 votes
2 answers 2 answers
10.2k
10.2k views
Na462 asked May 2, 2018
10,199 views
My Doubt is :- 1. If n vertices are there and p are the connected components then total n-p edges will be there.2. In a simple graph with n vertices and p connected compo...
0 0 votes
0 0 answers
880
880 views
iarnav asked May 13, 2018
880 views
I know, Kosaraju algorithm and there's one other algorithm which involves reversing of G and using DFS, but two times, but there's some algorithm which uses DFS only time...
1 1 vote
1 answers 1 answer
1.2k
1.2k views