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 = ;

 const int N = ;
 int dis[N];
 vector<bool> visit(N);
 int graph[N][N] = {{, , , , },
                    {, , , , },
                    {, , , , },
                    {, , , , },
                    {, , , , }};

 void prim() {
     int s = ;
     visit[s] = true;
     dis[s] = ;
     for (int i = ; i < N; i++) {
         int min_dis = MAX;
         int u;
         for (int i = ; 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 = ; i < N; i++) cout << dis[i] << endl;
     return ;
 }