C++怎么实现一个最小生成树Prim算法_C++图论算法与邻接矩阵实现

const int V = 5; // 顶点数
int graph[V][V] = {
    {0, 2, 0, 6, 0},
    {2, 0, 3, 8, 5},
    {0, 3, 0, 0, 7},
    {6, 8, 0, 0, 9},
    {0, 5, 7, 9, 0}
};

#include <iostream>
#include <climits>
using namespace std;
<p>int minKey(int key[], bool mstSet[]) {
int min = INT_MAX, min_index;
for (int v = 0; v < V; v++)
if (!mstSet[v] && key[v] < min)
min = key[v], min_index = v;
return min_index;
}</p><p>void printMST(int parent[], int graph[V][V]) {
cout << "Edge \tWeight\n";
for (int i = 1; i < V; i++)
cout << parent[i] << " - " << i << "\t" << graph[i][parent[i]] << endl;
}</p><p>void primMST(int graph[V][V]) {
int parent[V];
int key[V];
bool mstSet[V];</p><pre class='brush:php;toolbar:false;'>for (int i = 0; i < V; i++)
    key[i] = INT_MAX, mstSet[i] = false;

key[0] = 0;
parent[0] = -1;

for (int count = 0; count < V - 1; count++) {
    int u = minKey(key, mstSet);
    mstSet[u] = true;

    for (int v = 0; v < V; v++)
        if (graph[u][v] && !mstSet[v] && graph[u][v] < key[v])
            parent[v] = u, key[v] = graph[u][v];
}

printMST(parent, graph);

Edge    Weight
0 - 1   2
1 - 2   3
0 - 3   6
1 - 4   5