Data Structure Graph: prim

最小生成树算法。这里的s是可以随意选取的，不影响树的生成，但是不同的s有不同的dis

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <string>
#include <fstream>
using namespace std;

const int MAX = 63535;

const int N = 5;
int dis[N];
vector<bool> visit(N);
int graph[N][N] = {{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}};

void prim() {
    int s = 0;
    visit[s] = true;
    dis[s] = 0;
    for (int i = 1; i < N; i++) {
        int min_dis = MAX;
        int u;
        for (int i = 0; i < N; i++) {
            if (!visit[i] && graph[s][i]) dis[i] = min(dis[i], dis[s] + graph[s][i]);
            if (!visit[i] && dis[i] < min_dis) {
                u = i;
                min_dis = dis[i];
            }
        }
        s = u;
        visit[s] = true;
    }
}

int main() {
    memset(dis, MAX, sizeof(dis));
    prim();
    for (int i = 0; i < N; i++) cout << dis[i] << endl;
    return 0;
}