Thanks to visit codestin.com Credit goes to github.com
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent a7d421a commit b98a3a7Copy full SHA for b98a3a7
src/graph/bipartite-check.md
@@ -46,3 +46,4 @@ cout << (is_bipartite ? "YES" : "NO") << endl;
46
### Practice problems:
47
48
- [SPOJ - BUGLIFE](http://www.spoj.com/problems/BUGLIFE/)
49
+- [Codeforces - Graph Without Long Directed Paths](https://codeforces.com/contest/1144/problem/F)
0 commit comments