Category: Dijkstra Algorithm

Single source shortest path algorithm and priority_queue used to solve the problem. #include <iostream> #include <queue> #include <cstdio> #include <vector> #define INF 1000000000 #define ll long long using namespace std; /* struct node{ int dest,weight; }; */ int n,m,src,dst; vector<pair<int,int> > vb[20005]; void dijkstra(vector<ll> distance) { int t_dist,t_node; int latency,v; pair<int,int> _intPair; priority_queue<pair<int,int>,vector<pair<int,int> >, greater<pair<int,int>

Continue Reading “10986” →