图论相关算法

1 dijkstra算法

const int N = 510;
int g[N][N];
int st[N];
int dist[N];
int path[N]; // 保存路径
int n, m;
void get_path(int v) {
    if (path[v] != -1) get_path(path[v]);
    printf("%d ", v);
}
void dijkstra() {
    memset(st, 0, sizeof st);
    dist[1] = 0;
    for (int i = 1; i < n; i ++) {
         int t = -1;
         for (int j = 1; j <= n; j ++) 
            if (!st[j] && (t == -1 || dist[t] > dist[j]))
                t = j;
         for (int j = 1; j <= n; j ++) 
            if (dist[j] > dist[t] + g[t][j]) {
                 dist[j] = dist[t] + g[t][j];
                 path[j] = t;
            }
           
        st[t] = true;
    }
}

2 floyd算法

int d[N][N];
int path[N][N];
// 打印路径
void get_path(int i, int j) {
    if (path[i][j] == -1) {
        printf("%d %d", i, j);
    } else {
        int mid = path[i][j];
        get_path(i, mid);
        get_path(mid, j);
    }
   
}
void floyd() {
      for (int k = 1; k <= n; k ++ )
        for (int i = 1; i <= n; i ++ )
            for (int j = 1; j <= n; j ++ )
                if (d[i][j] > d[i][k] + d[k][j])
                    d[i][j] = d[i][k] + d[k][j], path[i][j] = k;
}

3 prim算法

#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 510, INF = 0x3f3f3f3f;
int n,m;
int g[N][N];
int dist[N];
int st[N];
int prim() {
    memset(dist,0x3f, sizeof dist);
    int res = 0;
    for (int i = 0; i < n; i ++) {
        int t = -1; 
        for (int j = 1; j <= n; j ++) 
            if (!st[j] && (t == -1 || dist[t] > dist[j]))
                t = j;
        if (i && dist[t] == INF) return INF;
        if (i) res += dist[t];
        for (int j = 1; j <= n; j ++) 
            dist[j] = min(dist[j], g[t][j]);
        st[t] = 1;
        
    }
    return res;
}

4 kruskal算法

#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 200010;
int n, m;
int p[N];
struct Edge{
    int a, b, w;
    bool operator< (const Edge & e) const {
        return w < e.w;
    }
}edges[N];
int find(int x) {
    if (p[x] != x) p[x] = find(p[x]);
    return p[x];
}
int main () {
    cin >>  n >> m;
    for (int i = 0; i < m; i ++) {
        int a, b, c;
        cin >> a >> b >> c;
        edges[i] = {a, b, c};
    }
    int res = 0, cnt = 0;
    sort(edges, edges + m); // 库函数排序，下标从0开始
    for (int i = 0; i <= n; i ++) p[i] = i; // 初始化并查集
    for (int i = 0; i < m; i ++) {
        int a = find (edges[i].a);
        int b = find (edges[i].b);
        if (a != b) {
            res += edges[i].w;
            p[a] = b;
            cnt ++;
        }
    }
    if (cnt < n - 1) puts("impossible");
    else printf("%d", res);
    return 0;
}