Need help in Iterative implementation of Kosaraju's or Tarjan's algorithm for finding strongly connected components in a graph !

Правка en2, от akshit.lite, 2015-12-28 23:05:59

I am currently solving a problem on SPOJ on strongly connected components. I think i have figured out a correct algorithm for the problem. But i keep on getting SIGSEV ,perhaps the recursion is going to deep. I have'nt been able to figure out how the iterative version will look loke( the one i made up isn't giving correct output). It would be helpful if somene could share. PS : in refrence to http://www.spoj.com/problems/GOODA/ Thanks in advance.

Теги strongly connected, graphs, recursion-depth

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский akshit.lite 2015-12-28 23:05:59 2
en1 Английский akshit.lite 2015-12-28 22:46:38 581 Initial revision (published)