Hello, ↵
↵
I was trying to do the problem pushabox (http://usaco.org/index.php?page=viewproblem2&cpid=769) with biconnected components,butand I think the GeeksForGeeks implementation is incorrect. Can someone give a working C++ implementation to find biconnected components using Tarjan and Hopcroft's algorithm? Thanks!my biconnected components algorithm is right, but for some reason my code is producing the wrong answer on test cases 5-15. I have commented my code so it is easy to understand my logic. Can somebody help me figure out where my logical error is? Thanks!↵
↵
Code: https://ideone.com/SU9VU8↵
↵
-dx24816
↵
I was trying to do the problem pushabox (http://usaco.org/index.php?page=viewproblem2&cpid=769) with biconnected components,
↵
Code: https://ideone.com/SU9VU8↵
↵
-dx24816
