graphutilities.java

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

package twf.graph.directed;

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

public class GraphUtilities {
	public static Graph reverse(Graph G) {
		if (!G.directed()) return null;
		Graph g = new twf.graph.adjlist.Graph(G.V(), true);
		for (int v = 0; v < G.V(); v++) {
			AdjList A = G.getAdjList(v);
			for (int t = A.beg(); !A.end(); t = A.nxt()) {
				g.insert(new Edge(t, v));
			}
		}
		return g;
	}
	public static DenseGraph densecopy(Graph G) {
		DenseGraph D = new DenseGraph(G.V(), true);
		for (int v = 0; v < G.V(); v++) {
			AdjList A = G.getAdjList(v);
			for (int w = A.beg(); !A.end(); w = A.nxt()) {
				D.insert(new Edge(v, w));
			}
		}
		return D;
	}
}