UVA 11838-Come and Go getting wrong answer any help?

Revision en1, by pvpcoder, 2015-09-08 18:43:59

I am trying to solve this problems Problem.The problems is to check whether the given graph is a single strongly connected component or not.I used tarjan algorithm MY CODE shows the correct output for all test cases.But I am not able to get where the error is.

Tags scc, tarjan, graphs

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English pvpcoder 2015-09-08 18:43:59 458 Initial revision (published)