java 最小生成树 Prim算法

package maopao;

import java.util.Scanner;

public class Prim {
   static int MAXCOST=Integer.MAX_VALUE;
   static int prim(int weight[][],int n) {     
        int[] lowcost = new int[n+1];    
        int[] closest = new int[n+1];    
        boolean[] s = new boolean[n+1]; 
        s[1] = true;   
        for(int i = 2; i <= n; i++) {  
           lowcost[i] = weight[1][i];  
           closest[i] = 1;  
           s[i] = false;  
        }  
        for(int i = 1; i < n; i++) {  
           int min = 10000000;  
           int j = 1;  
        for(int k = 2; k <= n; k++) {  
           if((lowcost[k] < min) && (!s[k])) {  
               min = lowcost[k];  
               j = k;  
           }  
        }  
        System.out.printf("%c - %c : %d\n", closest[j] + 'A' - 1, j + 'A' - 1, min);
        s[j] = true;   
        for(int k = 2; k <= n; k++) {  
            if((weight[j][k] < lowcost[k]) && !s[k]) {  
               lowcost[k] = weight[j][k];