2
我正在使用帶有Java中的PriorityQueue的Prim's Algorithm使用最小生成樹。但是，我得到的總重量（樹的最小重量）是錯誤的。Prim的算法
我誤解總重量背後的概念，或者是有一些問題，我的代碼？
public int getMinSpanningTree(Graph g) {
int[][] matrix = g.getEdgeMatrix();
int totalVertices = g.getNumberOfVertices();
boolean[] visit = new boolean[totalVertices];
int visitNum = 1;
int totalWeight = 0;
PriorityQueue<PriorityVertex> queue = new PriorityQueue<PriorityVertex>();
//FIRST ITERATION
visit[0] = true;
for (int i = 0; i < totalVertices; i++) {
if(matrix[0][i] > 0) {
PriorityVertex temp = new PriorityVertex(i, g.getWeight(0,i));
queue.add(temp);
}
}
while (visitNum < totalVertices) {
PriorityVertex temp = queue.poll();
visit[temp.vertex] = true;
visitNum++;
totalWeight = temp.priority + totalWeight;
//RUN NEIGHBOUR VERTICES
for (int k = 0; k < totalVertices; k++) {
if(matrix[temp.vertex][k] > 0 && visit[k] == false) {
PriorityVertex vertex = new PriorityVertex(k, g.getWeight(temp.vertex, k));
queue.add(vertex);
}
}
}
return totalWeight;
}