LeetCode 785. Is Graph Bipartite?

Given an undirected graph, return true if and only if it is bipartite.
Recall that a graph is bipartite if we can split it's set of nodes into two independent subsets A and B such that every edge in the graph has one node in A and another node in B.
The graph is given in the following form: graph[i] is a list of indexes j for which the edge between nodes i and j exists.  Each node is an integer between 0 and graph.length - 1.  There are no self edges or parallel edges: graph[i] does not contain i, and it doesn't contain any element twice.

判断二分图，二分图染色的基本做法，DFS加染色

class Solution {
public:
    int c=1;
    int color[110]={0};
    bool isBipartite(vector<vector<int>>& graph) {
        for(int i=0; i<graph.size(); i++){
            if(color[i]==0){
                if(!DFS(i,c,graph)){
                    return false;
                }
            }
        }
        return true;
    }
    bool DFS(int v, int c,vector<vector<int>>& graph){
        color[v]=c;
        for(int i=0; i<graph[v].size(); i++){
            if(color[graph[v][i]]==c)
                return false;
            if(color[graph[v][i]]==0&&!DFS(graph[v][i],-c,graph))
                return false;
        }
        return true;
    }
};