PRIM算法

同样是求最小生成树的PRIM算法，废话不多说了，直接上代码吧

package oj;class Edge2{int x1;int x2;int len;public Edge2(int x1, int x2, int len) {this.x1 = x1;this.x2 = x2;this.len = len;}public int getX1() {return x1;}public void setX1(int x1) {this.x1 = x1;}public int getX2() {return x2;}public void setX2(int x2) {this.x2 = x2;}public int getLen() {return len;}public void setLen(int len) {this.len = len;}}public class PRIM {public static void prim(int[][] V,int n){int[] X=new int[n];int[] Y=new int[n];int[] c=new int[n];Edge[] T=new Edge[n-1];c[0]=0;int[] flag=new int[n];flag[0]=1;int t=0;int k=0;int min;int minp;while(t<n-1){min=9999;for(int i=1;i<=n-1;i++){if((c[i]<min)&&(flag[i]==0)){min=c[i];minp=i;}}}}}