graphutilities.java

来自「个人学习图算法时写的源码 包括最小生成树, 最大网络流, DSF遍历, BSF」· Java 代码 · 共 21 行

package twf.weightedgraph.common;

import twf.weightedgraph.AdjList;
import twf.weightedgraph.Edge;
import twf.weightedgraph.Graph;

public class GraphUtilities {
	public static Edge[] edges(Graph G) {
		Edge[] edges = new Edge[G.E()];		
		int cnt = 0;
		for (int i = 0; i < G.V(); i++) {
			AdjList A = G.getAdjList(i);
			for (Edge e = A.beg(); !A.end(); e = A.nxt()) {
				if (G.directed() || e.other(i) > i)
				edges[cnt++] = e;
			}
		}
		return edges;
	}
}