8000
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 574f279 commit 5b056a2Copy full SHA for 5b056a2
May-LeetCoding-Challenge/27-Possible-Bipartition/Possible-Bipartition.cpp
@@ -3,6 +3,7 @@ class Solution {
3
vector<int> color;
4
vector<vector<int>> G;
5
6
+ // Return true if the connected component of u is a bipartite graph
7
bool bipartite(int u) {
8
for (int i = 0; i < G[u].size(); i++) {
9
int v = G[u][i];
0 commit comments