题意:
给出一个N。接下来有一个N * N的邻接矩阵A,第 i 行 第 j 列代表点 i 和 j 相距A[i][j].求连同所有点的最短路径,求最小生成树即可。
思路:
用P算法,直接用邻接矩阵来存放数据就好了。
import java.util.Scanner;
public class Main {
final static int MAXN = 100 + 3;
final static int INF = 100000 + 3;
static int[][] arv = new int[MAXN][MAXN];
static int[] used = new int[MAXN];
static int[] lowCose = new int[MAXN];
public static void main(String[] args){
Scanner cin = new Scanner(System.in);
int N;
while(cin.hasNext()){
N = cin.nextInt();
for(int i = 1; i <= N; i++){
for(int j = 1; j <= N; j++){
arv[i][j] = cin.nextInt();
if(arv[i][j] == 0){
arv[i][j] = INF;
}
}
}
int ans = prim(1, N);
System.out.println(ans);
}
cin.close();
}
public static int prim(int sta, int N){
for(int i = 1; i <= N; i++){
lowCose[i] = arv[sta][i];
used[i] = 0;
}
used[sta] = 1;
int cntWgt = 0;
for(int i = 1; i <= N -1; i++){
int v = -1;
int mini = INF;
for(int j = 1; j <= N; j++){
if(used[j] == 0 && mini > lowCose[j]){
mini = lowCose[j];
v = j;
}
}
if(v != -1){
cntWgt += lowCose[v];
used[v] = 1;
for(int j = 1; j <= N; j++){
if(used[j] == 0 && lowCose[j] > arv[v][j]){
lowCose[j] = arv[v][j];
}
}
}
}
return cntWgt;
}
}