迪杰斯特拉算法 旅游规划

#include <iostream>
#include<vector>

using namespace std;
const int max_vertex_number = 500;

class Map {
    int matrix[max_vertex_number][max_vertex_number]={0};
    int matrix_cost[max_vertex_number][max_vertex_number]={0};
    int distance[max_vertex_number] = {0};
    int cost[max_vertex_number]={0};
    int vertex_number;
    string vertex[max_vertex_number];
    vector<int> path[max_vertex_number];
    int start,end;
    int edges=0;
    bool done[max_vertex_number] = {false};
public:
    Map() {
        cin >> vertex_number>>edges>> start>>end;
        for(int i=0;i<edges;i++){
            int tail,head,length,fee;
            cin>>head>>tail>>length>>fee;
            matrix[head][tail]=matrix[tail][head]=length;
            matrix_cost[head][tail]=matrix_cost[tail][head]=fee;
        }
    }

    void Dijkstra() {
        for (int i = 0; i < vertex_number; i++) {
            if (matrix[start][i]) {
                distance[i] = matrix[start][i];
                cost[i]=matrix_cost[start][i];
            }
        }
        done[start] = true;
        for (int i = 0; i < vertex_number - 1; i++) {
            int minDistance = 0x3f3f3f3f;
            int minIndex;
            int minCost=0x3f3f3f3f;
            for (int j = 0; j < vertex_number; j++)
                if (done[j] == false && distance[j] &&( distance[j] < minDistance||distance[j]==minDistance&&cost[j]<minCost)) {
                    minIndex = j;
                    minDistance = distance[j];
                    minCost=cost[j];
                }
            done[minIndex] = true;
            for (int j = 0; j < vertex_number; j++)
                if (matrix[minIndex][j] && done[j] == false &&
                    (minDistance + matrix[minIndex][j] < distance[j] || distance[j] == 0||minDistance+matrix[minIndex][j]==distance[j]&&minCost+matrix_cost[minIndex][j]<cost[j])) {
                    distance[j] = minDistance + matrix[minIndex][j];
                    cost[j]=minCost+matrix_cost[minIndex][j];
                }
        }
    }
    void Show(){
        Dijkstra();
        cout<<distance[end]<<' '<<cost[end];
    }
};

int main() {
    Map test;
    test.Show();
}