浙大陈越数据结构-07-图4哈利·波特的考试

#include <iostream>
#include <algorithm>
#include <queue>
#include <climits>
#include <memory>

using namespace std;

typedef pair<int, int> PAIR;
typedef shared_ptr<struct GraphEdge> Pointer;
struct GraphEdge{
    int m_node;
    int m_weight;
    Pointer next;
    GraphEdge(int num, int weight) : m_node(num), m_weight(weight), next(nullptr){}
};

struct Graph{
    vector<Pointer> m_graph;
    Graph(int nodeSize) : m_graph(vector<Pointer>(nodeSize + 1)){}
    void insertEdge(int start, int end, int weight);
};

void Graph::insertEdge(int start, int end, int weight){
    Pointer tmp(new GraphEdge(end, weight));
    tmp->next = m_graph[start];
    m_graph[start] = tmp;
}


int dijkstra(Graph& graph, int start, int nodeSize){
    vector<int> dist(nodeSize + 1, INT_MAX);
    vector<bool> visited(nodeSize + 1, false);//收集已经被收录进去的节点。
    priority_queue<PAIR, vector<PAIR>, greater<PAIR>> minHeap;

    dist[start] = 0;
    minHeap.push({0, start});
    int maxlength = 0;
    while(!minHeap.empty()){
        auto t = minHeap.top();
        minHeap.pop();

        int node = t.second;
        if(visited[node]) continue;//如果被收录进去了，那么就不再继续。因为下面有些点的相邻点是已经被收录进去的点。
        visited[node] = true;

        if(maxlength < t.first)
            maxlength = t.first;

        for(auto i = graph.m_graph[node]; i; i = i->next){
            int j = i->m_node;
            if(dist[j] > dist[node] + i->m_weight){
                dist[j] = dist[node] + i->m_weight;
                minHeap.push({dist[j], j});
            }
        }
    }
    for(int i = 1; i <= nodeSize; i++){
        if(visited[i] == false){

            return INT_MAX;
        }


    }

    return maxlength;

}
bool cmp(PAIR& a, PAIR& b){
    if(a.first == b.first)
        return a.second < b.second;
    return a.first < b.first;
}

void IOProcess0704(){
    int n, m;
    scanf("%d%d", &n, &m);
    Graph graph(n);
    for(int i = 0; i < m; i++){
        int a, b ,c;
        scanf("%d%d%d", &a, &b, &c);
        graph.insertEdge(a, b, c);
        graph.insertEdge(b, a, c);
    }
    vector<pair<int, int>> ans(n);
    for(int i = 1; i <= n; i++){
        int length = dijkstra(graph, i, n);
        ans[i - 1] = {length, i};
    }
    sort(ans.begin(), ans.end(), cmp);
    if(ans[0].first == INT_MAX)
        printf("0");
    else
        printf("%d %d", ans[0].second, ans[0].first);

}

int main(){
    IOProcess0704();
    return 0;
}