c++迪杰斯特拉模板

#include<iostream>
#include<map>
#include<queue>
#include<vector>
#include<set>
using namespace std;

struct tmp1{
    bool operator() (pair<string, int>a, pair<string, int>b){
        return a.second > b.second;
    }
};


void dijkstra(map<string, map<string, int>> graph, string s, map<string, string> &parent, map<string, int> &distance){
    priority_queue<pair<string, int>, vector<pair<string, int>>, tmp1> queue;
    queue.push(pair<string, int>(s, 0));
    set<string> seen;
    distance[s] = 0;

    while(!queue.empty()){
         pair<string, int> vertex = queue.top();
         queue.pop();
         string node = vertex.first;
         int dis = vertex.second;
         seen.insert(node);
         map<string, int> nex_s = graph[node];
        for(auto nex: nex_s){
             string nex_node = nex.first;
            if(seen.find(nex_node) == seen.end()){ //没有被看见
                if(dis + graph[node][nex_node] < distance[nex_node]){
                    queue.push(pair<string, int>(nex_node, dis + graph[node][nex_node]));
                    parent[nex_node] = node;
                    distance[nex_node] =  dis + graph[node][nex_node];
                }
            }
         }
    }


}

map<string, int> initdistance(string s, map<string, map<string, int>>graph){
    map<string, int> dis = {{s,0}};
    for(auto vertex: graph){
        if(vertex.first != s){
            dis[vertex.first] = INT32_MAX;
        }
    }
    return dis;
}

int main(){
    map<string, map<string, int>> graph;
    graph["A"] = {{"B",5},{"C", 1}};
    graph["B"] = {{"A", 5},{"C", 2},{"D", 1}};
    graph["C"] = {{"A", 1},{"B", 2},{"D", 4},{"E", 8}};
    graph["D"] = {{"B", 1},{"C", 4},{"E", 3}, {"F", 6}};
    graph["E"] = {{"C", 8},{"D", 3}};
    graph["F"] = {{"D", 6}};
    map<string, string> parent;
    map<string, int> distance = initdistance("A", graph);
    dijkstra(graph, "A", parent, distance);
    for(auto i : parent){
        cout << i.first << " : " << i.second << " " ;
    }
    cout << endl;
    for(auto i: distance){
        cout << i.first << " : " << i.second <<" ";
    }
    cout << endl;

    return 0;
}