java数据结构和算法------图(最小生成树Prim)

package iYou.neugle.graph;

import java.util.ArrayList;
import java.util.List;

//创建图过程的代码在图的那篇博文中，此处直接使用
public class Prim {
    private MyGraph1 graph;
    private List<Integer> v = new ArrayList<Integer>();// 待处理集合
    private List<Integer> u = new ArrayList<Integer>();// 已处理集合

    public Prim(MyGraph1 graph) {
        this.graph = graph;
    }

    private void Init() {
        for (int i = 0; i < this.graph.getGraph().maxNum; i++) {
            v.add(i);
        }
    }

    // Prim核心方法
    public void PrimCore() {
        this.Init();
        u.add(v.get(0));
        v.remove(0);
        System.out.println("最小生成树为--------");
        int weight = 0;
        while (u.size() < this.graph.getGraph().maxNum) {
            int minw = Integer.MAX_VALUE;
            int v1 = 0, v2 = 0, r = 0;
            for (int i = 0; i < this.u.size(); i++) {
                int a = this.u.get(i);
                for (int j = 0; j < this.v.size(); j++) {
                    int b = this.v.get(j);
                    int currentw = this.graph.getGraph().edge[a][b];
                    if (currentw > 0 && currentw < minw) {
                        minw = currentw;// 权值
                        v1 = a;// 第一条边
                        v2 = b;// 第二条边
                        r = j;// 在v中待删除元素
                    }
                }
            }
            System.out.println((v1 + 1) + "->" + (v2 + 1));
            weight += minw;
            this.u.add(v2);
            this.v.remove(r);
        }
        System.out.println("----------------");
        System.out.println("最小生成树的权值为: " + weight);
    }

    //主函数
    public static void main(String[] args) {
        MyGraph1 graph = new MyGraph1(5, 0);
        graph.CreateMaxtrixGraph(1, 2, 2);
        graph.CreateMaxtrixGraph(1, 3, 5);
        graph.CreateMaxtrixGraph(1, 5, 3);
        graph.CreateMaxtrixGraph(2, 4, 4);
        graph.CreateMaxtrixGraph(3, 5, 5);
        graph.CreateMaxtrixGraph(4, 5, 2);
        graph.OutPutMaxtrixGraph();
        Prim prim = new Prim(graph);
        prim.PrimCore();
    }
}

  1 2 3 4 5 
1 0 2 5 0 3 
2 2 0 0 4 0 
3 5 0 0 0 5 
4 0 4 0 0 2 
5 3 0 5 2 0 
最小生成树为--------
1->2
1->5
5->4
1->3
----------------
最小生成树的权值为: 12