Prim算法:
时间复杂度O(V*E)。解决无向连通图 求取 最小生成树问题。
Edge数据结构:
public class Edge{
public int v1;
public int v2;
public int length;
public Edge() {
super();
}
public Edge(int v1, int v2, int length) {
super();
this.v1 = v1;
this.v2 = v2;
this.length = length;
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append("v1: "+v1+" \t v2: "+v2+" \t length : "+length);
return sb.toString();
}
}
Prim算法主体:
package wisers.crawler;
import java.util.ArrayList;
import java.util.List;
/**
* 贪婪算法
* 求取最小生成树
*/
public class Prim {
public static List<Edge> prim(List<Edge> source,List<Integer> vertexs){
List<Edge> result = new ArrayList<Edge>();
List<Integer> u =new ArrayList<Integer>();
List<Integer> s = vertexs;
s.remove(new Integer(1));
u.add(1);
while (!s.isEmpty()) {
Edge min = new Edge();
min.length = Integer.MAX_VALUE;
for (Edge edge : source) {
if (u.contains(edge.v1) && s.contains(edge.v2) && edge.length < min.length) {
min = edge;
}else if (u.contains(edge.v2) && s.contains(edge.v1) && edge.length < min.length) {
min = edge;
}else {
}
}
if (u.contains(min.v1)) {
u.add(min.v2);
s.remove(new Integer(min.v2));
}else {
u.add(min.v1);
s.remove(new Integer(min.v1));
}
source.remove(min);
result.add(min);
}
return result;
}
public static void main(String[] args) {
List<Edge> edges = new ArrayList<Edge>();
edges.add(new Edge(1, 2, 2));
edges.add(new Edge(1, 3, 4));
edges.add(new Edge(1, 4, 1));
edges.add(new Edge(2, 4, 3));
edges.add(new Edge(2, 5, 10));
edges.add(new Edge(3, 4, 2));
edges.add(new Edge(3, 6, 5));
edges.add(new Edge(4, 5, 7));
edges.add(new Edge(4, 6, 8));
edges.add(new Edge(4, 7, 4));
edges.add(new Edge(5, 7, 6));
edges.add(new Edge(6, 7, 1));
List<Integer> vertexs = new ArrayList<Integer>();
for (int i = 1; i <= 7; i++) {
vertexs.add(i);
}
List<Edge> result = prim(edges, vertexs);
for (Edge edge : result) {
System.out.println(edge);
}
}
}
运行结果:
v1: 1 v2: 4 length : 1
v1: 1 v2: 2 length : 2
v1: 3 v2: 4 length : 2
v1: 4 v2: 7 length : 4
v1: 6 v2: 7 length : 1
v1: 5 v2: 7 length : 6