package leetcode;

/**
 * https://leetcode.com/problems/is-graph-bipartite/
 */
public class Problem785 {
    public boolean isBipartite(int[][] graph) {
        // TODO
        return false;
    }

    public static void main(String[] args) {
        Problem785 prob = new Problem785();
    }
}

@@ -281,16 +281,265 @@
 m785();%0A
+        System.out.println(prob.isBipartite(new int%5B%5D%5B%5D%7B%0A            %7B1, 3%7D, %7B0, 2%7D, %7B1, 3%7D, %7B0, 2%7D%0A        %7D)); // true%0A        System.out.println(prob.isBipartite(new int%5B%5D%5B%5D%7B%0A            %7B1, 2, 3%7D, %7B0, 2%7D, %7B0, 1, 3%7D, %7B0, 2%7D%0A        %7D)); // false%0A
     %7D%0A%7D%0A

Update problem 785