Dijkstra, Leetcode Medium, Graph, Cpp.
vector<tple>, greater<tple>> minHeap; unordered_map<int/*src*/, unordered_map<int/*dst*/, int/*cost*/>> graph; void create_weighted_graph(int cities, VecVecI& flights) { for (int i=0;i<flights.size();++i) { int src = flights[i][0]; int dst = flights[i][1]; int cost = flights[i][2];