最短路径 dj 迪杰斯特拉dijkstra

最新推荐文章于 2020-08-30 13:50:41 发布

闲庭絮

最新推荐文章于 2020-08-30 13:50:41 发布

阅读量622

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/VP_Death_Note/article/details/81670572

本文介绍了一个关于寻找牛Bessie从牧场返回谷仓的最短路径的问题，并提供了一段C++代码实现。该算法利用了Dijkstra算法来解决带有权重的无向图中的最短路径问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

DJ

直接看题：

Til the Cows Come Home

Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get back as quickly as possible.

Farmer John's field has N (2 <= N <= 1000) landmarks in it, uniquely numbered 1..N. Landmark 1 is the barn; the apple tree grove in which Bessie stands all day is landmark N. Cows travel in the field using T (1 <= T <= 2000) bidirectional cow-trails of various lengths between the landmarks. Bessie is not confident of her navigation ability, so she always stays on a trail from its start to its end once she starts it.

Given the trails between the landmarks, determine the minimum distance Bessie must walk to get back to the barn. It is guaranteed that some such route exists.

Input

* Line 1: Two integers: T and N

* Lines 2..T+1: Each line describes a trail as three space-separated integers. The first two integers are the landmarks between which the trail travels. The third integer is the length of the trail, range 1..100.

Output

* Line 1: A single integer, the minimum distance that Bessie must travel to get from landmark N to landmark 1.

Sample Input

Sample Output

Hint

INPUT DETAILS:

There are five landmarks.

OUTPUT DETAILS:

Bessie can get home by following trails 4, 3, 2, and 1.

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 2005;
const int INF = (1 << 31) - 1;

typedef pair<int, int> pii;
priority_queue<pii, vector<pii>, greater<pii> >q;

int edge[MAXN][MAXN];
int d[MAXN];
int n, m;//n 条边 , m 个顶点

int Dj(int start) {
    bool used[MAXN] = {0};
    for (int i = 1; i <= n; i++) {
        d[i] = (i == start ? 0 : INF);
    }
    q.push(make_pair(d[start], start));
    while (!q.empty()) {
        pii u = q.top();
        q.pop();
        int x = u.second;
        if (used[x]) {
            continue;
        }
        used[x] = true;
        for (int j = 1; j <= n; j++) {
            if (!used[j] && edge[x][j] < INF && d[j] > d[x] + edge[x][j]) {
                d[j] = d[x] + edge[x][j];
                q.push(make_pair(d[j], j));
            }
        }
    }
    return d[n];
}

int main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i == j) {
                edge[i][j] == 0;
            }
            else {
                edge[i][j] = INF;
            }
        }
    }
    int u, v, w;
    for (int i = 1; i <= m; i++) {
        cin >> u >> v >> w;
        if (w < edge[u][v]) {
            edge[u][v] = w;
            edge[v][u] = w;
        }
    }
//    cout << "下面是打印邻接矩阵:\n";
//    for (int i = 1; i <= n; i++) {
//        for (int j = 1; j <= n; j++) {
//            if (edge[i][j] == INF) {
//                cout << "∞\t";
//            }
//            else {
//                cout << edge[i][j] << "\t";
//            }
//        }
//        cout << "\n\n";
//    }
    cout << Dj(1) << endl;
    return 0;
}