topologicalsortchecker.java

个人学习图算法时写的源码 包括最小生成树, 最大网络流, DSF遍历, BSF遍历,

package twf.graph.directed;

import twf.adt.graph.AdjList;
import twf.adt.graph.Graph;

public class TopologicalSortChecker {
	public static boolean check(Graph dag, int[]order) {
		for (int i = 0; i < dag.V(); i++) {
			AdjList A = dag.getAdjList(i);
			for (int t = A.beg(); !A.end(); t = A.nxt()) {
				if (order[t] > order[i]) return false;
			}
		}
		return true;
	}
}