day61|Bellman_ford 队列优化算法（又名SPFA）,bellman_ford之判断负权回路,bellman_ford之单源有限最短路

最新推荐文章于 2024-08-11 17:24:39 发布

bindloy

最新推荐文章于 2024-08-11 17:24:39 发布

阅读量150

点赞数 3

文章标签：算法

本文链接：https://blog.csdn.net/bindloy/article/details/141055641

版权

Bellman_ford 队列优化算法（又名SPFA）

94. 城市间货物运输 I (kamacoder.com)

#include <iostream>
#include <vector>
#include <queue>
#include <list>
#include <climits>
using namespace std;

struct Edge { 
    int to;  
    int val; 

    Edge(int t, int w): to(t), val(w) {}  
    
};


int main() {
    int n, m, s, t, v;
    cin >> n >> m;

    vector<list<Edge>> grid(n + 1); 

    vector<int> isInQueue(n + 1);


    for(int i = 0; i < m; i++){
        cin >> s >> t >> v;
        grid[s].push_back(Edge(t, v));
    }

    vector<int> minDist(n + 1 , INT_MAX);
    minDist[1] = 0;

    queue<int> que;
    que.push(1); 

    while (!que.empty()) {

        int cur = que.front(); 
        que.pop();
        isInQueue[cur] = false;
        for (Edge edge : grid[cur]) {
            int from = cur;
            int to = edge.to;
            int value = edge.val;
            if (minDist[to] > minDist[from] + value) { 
                minDist[to] = minDist[from] + value; 
                if (isInQueue[to] == false) { 
                    que.push(to);
                    isInQueue[to] = true;
                }
            }
        }

    }
    if (minDist[n] == INT_MAX) cout << "unconnected" << endl;
    else cout << minDist[n] << endl; 
}

bellman_ford之判断负权回路

95. 城市间货物运输 II (kamacoder.com)

#include <iostream>
#include <vector>
#include <list>
#include <climits>
using namespace std;

int main() {
    int n, m, p1, p2, val;
    cin >> n >> m;

    vector<vector<int>> grid;

    for(int i = 0; i < m; i++){
        cin >> p1 >> p2 >> val;
        grid.push_back({p1, p2, val});

    }
    int start = 1; 
    int end = n;

    vector<int> minDist(n + 1 , INT_MAX);
    minDist[start] = 0;
    bool flag = false;
    for (int i = 1; i <= n; i++) { 
        for (vector<int> &side : grid) {
            int from = side[0];
            int to = side[1];
            int price = side[2];
            if (i < n) {
                if (minDist[from] != INT_MAX && minDist[to] > minDist[from] + price) minDist[to] = minDist[from] + price;
            } else { 
                if (minDist[from] != INT_MAX && minDist[to] > minDist[from] + price) flag = true;

            }
        }

    }

    if (flag) cout << "circle" << endl;
    else if (minDist[end] == INT_MAX) {
        cout << "unconnected" << endl;
    } else {
        cout << minDist[end] << endl;
    }
}

bellman_ford之单源有限最短路

96. 城市间货物运输 III (kamacoder.com)

#include <iostream>
#include <vector>
#include <list>
#include <climits>
using namespace std;

int main() {
    int src, dst,k ,p1, p2, val ,m , n;
    
    cin >> n >> m;

    vector<vector<int>> grid;

    for(int i = 0; i < m; i++){
        cin >> p1 >> p2 >> val;
        grid.push_back({p1, p2, val});
    }

    cin >> src >> dst >> k;

    vector<int> minDist(n + 1 , INT_MAX);
    minDist[src] = 0;
    for (int i = 1; i <= k + 1; i++) { 
        for (vector<int> &side : grid) {
            int from = side[0];
            int to = side[1];
            int price = side[2];
            if (minDist[from] != INT_MAX && minDist[to] > minDist[from] + price) minDist[to] = minDist[from] + price;
        }

    }

    if (minDist[dst] == INT_MAX) cout << "unreachable" << endl; 
    else cout << minDist[dst] << endl; 

}