fengzhengwszz的博客

leetcode210 拓扑排序：有向无环图的排序 /*关于拓扑排序 * 有向无环图的排序 * */ public int[] findOrder(int numCourses, int[][] prerequisites) { //1、首先构建一个邻接矩阵表示图 List<List<Integer>> edges = new ArrayList<>();//邻接矩阵 int[] indeg = n

判断二分图 关于图，常用的就是bfs和队列 class Solution { private static final int UNCOLORED = 0; private static final int RED = 1; private static final int GREEN = 2; private int[] color; public boolean isBipartite(int[][] graph) { int n =.