Add practice problems to strongly connected components article (cp-algorithms#132)

ujzwt4it · tcNickolas · commit bda7ce99d9f5 · 2016-10-30T19:13:19.000-07:00
diff --git a/src/graph/strongly-connected-components.md b/src/graph/strongly-connected-components.md
@@ -100,3 +100,10 @@ Here, $g$ is graph, $gr$ is transposed graph. Function $dfs1$ implements depth f
 
 * Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein. Introduction to Algorithms [2005].
 * M. Sharir. A strong-connectivity algorithm and its applications in data-flow analysis [1979].
+
+##Practice Problems
+- [SPOJ - Submerging Islands](http://www.spoj.com/problems/SUBMERGE/)
+- [SPOJ - Good Travels](http://www.spoj.com/problems/GOODA/)
+- [SPOJ - Lego](http://www.spoj.com/problems/LEGO/)
+- [Codechef - Chef and Round Run](https://www.codechef.com/AUG16/problems/CHEFRRUN)
+
