旅游规划（

最新推荐文章于 2024-03-23 16:16:46 发布

weixin_46884242

最新推荐文章于 2024-03-23 16:16:46 发布

阅读量326

点赞数

文章标签： c++

本文链接：https://blog.csdn.net/weixin_46884242/article/details/122876875

版权

#include <iostream>
using namespace std;
int city, road, start, end1;
int path[505] = {0}, disk[505] = {0}, altol[505] = {0};
int money[505][505] = {0};
int Length[505][505] = {0};//浪费大量内存
int visted[505] = {0};
void init(){
    for(int i = 0; i < 505; i++){
        path[i] = -1;
        disk[i] = 505;
    }
    for(int i = 0; i < 505; i++)
        for(int j = 0; j < 505; j++){
            if(Length[i][j] == 0)
                Length[i][j] = Length[j][i] = 505;
        }
    for(int i = 0; i < 505; i++)
        for(int j = 0; j < 505; j++){
            if(i == j)
                Length[i][j] = Length[j][i] = 0;
        }
            
}
int Disijak(int N){
    int v = start;
    disk[v] = 0;
    visted[v] = 1;
    for(int i = 0; i < N; i++){
        if(Length[v][i] != 505){
            disk[i] = Length[v][i];
            altol[i] = money[v][i];
        }
    }
    while(1){
        int small, charge = 505;
        bool fiag = 0;
        for(int i = 0; i < N; i++){
            if(visted[i] == 0){
                if(disk[i] < charge){ //这里是disk
                    charge = disk[i];
                    small = i;
                    fiag = 1;
                }                   
            }
        }
        if(!fiag) break;
        v = small;
        visted[v] = 1;
        for(int i = 0; i < N; i++){
            if(visted[i] == 0)
                if(Length[v][i] < 505){
                    if(disk[v] + Length[v][i] < disk[i]){
                        disk[i] = disk[v] + Length[v][i];
                        altol[i] = altol[v] + money[i][v];
                        path[i] = v;
                    }
                    else if(disk[v] + Length[v][i] == disk[i]){
                        if(altol[v] + money[v][i] < altol[i]){
                            disk[i] = disk[v] + Length[v][i];
                            altol[i] = altol[v] + money[i][v];
                            path[i] = v;
                        }
                    }
                }
        }
    }
}
int main()
{
    cin >> city >> road >> start >> end1;
    int L1, L2, L3, L4;
    init();
    for(int i = 0; i < road; i++){
        cin >> L1 >> L2 >> L3 >> L4;
        Length[L1][L2] = Length[L2][L1] = L3;
        money[L1][L2] = money[L2][L1] = L4;
    } //初始化数组；
    Disijak(city);
    cout << disk[end1] << ' ' << altol[end1];
}