实现拓扑排序：一个有向无环图，表述为一个邻接矩阵graph[n][n]，其中graph[i][0]为顶点i的入度，其余为其后继结点。-The realization of topological sort: a directed acyclic graph, expressed as an adjacency matrix graph [n] [n], which graph [i] [0] for the vertex i of income, the remaining node to its successor.