### Diplomate's blog

By Diplomate, history, 6 years ago,

What is the best for Dijkstra's algorithm: set with erasing of the vertices adjacent to the current one and the subsequent insertion of them with the new values or a priority_queue with a lot of irrelevant vertices? Or maybe some other approach using std?

• +11

 » 6 years ago, # |   0 I remember in an article on Topcoder about STL (you can google it easily, part 2), they are said to not differ much in terms of performance, only by 0.1% in practice.Dijkstra with set, in my opinion, is clearer to code.
•  » » 6 years ago, # ^ | ← Rev. 2 →   +13 How did you measure that?Try solving this with std::set.I didn't manage to succeed even though I'm pretty sure my code is optimal enough, std::set is slower than std::priority_queue by more that 30 times on this specific task. Submissions' summaryI have also submitted 20C - Dijkstra? more than 30 times with using many different data structures, so I guess that priority_queue is WAY faster than std::set, at least like 2-3 times, but sometimes this advantage can be up to 20-30 times on some specific graphs.The only drawback I've seen so far is that the memory consumed by this Dijkstra is not O(N) but is O(M).
•  » » » 6 years ago, # ^ |   0 The task from main (sums) could be solved without Dijkstra, in a linear way. You're always adding edges as a kind of a cycle. For this specific problem, set might be slower but I've heard that it's better in general.
•  » » » » 6 years ago, # ^ | ← Rev. 6 →   +10 This might be because when priority_queue allocates O(M) memory it will work in . It might be slower for graphs where M is several orders greater than N. Why do I think it shouldn't affect really muchBut isn't it that = = ?This should be some sort of weird task where N2 ≤ M, and for shortest-path problem we can ignore multiple edges, so most of these problems will still work in Usually in tasks you see something like 1 ≤ N, M ≤ 105 so, I believe, in general it is better to use priority_queue.
•  » » » » » 6 years ago, # ^ | ← Rev. 3 →   +3 You are mixing apples and oranges.First of all, if you use Dijkstra to solve Sums from MAIN, you should use an O(n^2) implementation, because it is a dense graph. The set/priority_queue implementations are both O(n^2 log n) for dense graphs. The log n overhead is unnecessary.Benchmarking set vs. priority queue on dense graphs is pointless, as you shouldn't use either data structure in that setting.Second, you are probably doing something wrong/suboptimal in your Sums implementation. I just submitted an O(n^2 log n) solution using Dijkstra with a set for Sums and got 100 points.Finally, regarding the big picture: For sparse graphs I've seen a lot of benchmarks. The exact results of this comparison depended on way too many factors, such as the platform, compiler version, and optimization flags used. Still, the result was always (that I remember) that the runtime of one implementation was within twice the runtime of the other. In terms of programming contests (and also in terms of real life) a factor of two is negligible. I would never use the words "much faster" in this context.Feel free to choose the implementation you like better, in the tasks when using either is appropriate.
•  » » » » 5 years ago, # ^ |   +7 off the topic but i wanted to know how to solve the above problem in linear way. I don't know how to approach the problem. Even a little hint would be very helpful.
•  » » » 5 years ago, # ^ |   -18 hey....can you tell me the error in my code for dijkstra? 20C problem... here is my code : #include #define F first #define S second #define pii pair #define piii pair > #define mp make_pair #define pb push_back #define ll long long #define ull unsigned long long using namespace std; const ll mod=1e9+7; vector > adj[100005]; ll par[100005]; ll dist[100005]; void djk() { par[1] = 1; dist[1] = 0; priority_queue, vector >, greater > > pq; pq.push(mp(0,1)); while(!pq.empty()) { //cout<<"bug"; pair p = pq.top(); pq.pop(); ll u = p.S; for(ll i=0;i>n>>m; for(ll i=0;i>a>>b>>c; adj[a].pb(mp(b,c)); adj[b].pb(mp(a,c)); } for(ll i=1;i<=n;i++) dist[i]=mod; djk(); if(dist[n]==mod) { cout<<-1; } else { ll node = n; stacks; //for(ll i=1;i<=n;i++) cout<
•  » » » » 5 years ago, # ^ |   0 Update : i found the error.... Mod value is required to be much more here.
•  » » » 5 years ago, # ^ |   0
•  » » » 19 months ago, # ^ | ← Rev. 3 →   -31 UPD: Just now I've realized that it doesn't make any sense since the Dijkstra algorithm should use the set/priority_queue to get the minimum element and the unordered_set does not give us that.
 » 6 years ago, # |   +10 From my experience, priority_queue is much faster, maybe 2x faster than set.http://codeforces.com/contest/20/status/C?order=BY_CONSUMED_TIME_ASC
•  » » 6 years ago, # ^ |   0 A friend of mine has made such "comparisons" as well. You know what? The results were different :D
•  » » 6 years ago, # ^ |   0 This is all really weird.)
 » 6 years ago, # | ← Rev. 2 →   0 I tested Dijkstra's speed on this problem on spoj. ( spoj.com/problems/TSHPATH )As per the results: Set: 1.51 seconds while Priority Queue: 0.98 seconds.In my opinion too, priority queue is much faster than set.
 » 6 years ago, # | ← Rev. 2 →   0 Correct me if im wrong but priority queue is basically a heap so we get the min element in O(1) whereas set is a balanced bst so extract min is a O(logn) operation
•  » » 6 years ago, # ^ |   +6 Yes, you are wrong. In a heap you can find the minimum in O(1), but you then need O(log(heap_size)) anyway if you want to remove (pop) it from the heap. Which, in Dijkstra's algorithm, you do need.
•  » » » 6 years ago, # ^ |   0 Ah yes.. heapify takes O(logn) time, my bad...
•  » » » 5 years ago, # ^ |   -13 Nice!
 » 4 years ago, # |   -10 Sometimes set is faster than priority_queue because priority_queue includes extra set of vertices which makes my code lengthy.This submission
•  » » 19 months ago, # ^ | ← Rev. 2 →   -56 I don't know much coz i'm a beginner, i always used priority_queue for dijkshtra purpose but today used set for the below problem related to dijkshtra.i found set took 4 seconds whereas Priority_queue implementation took 6 seconds. what i concluded is Use set for sparse data when most of the valus are repeating or null(0) otherwise use priority_queue(note: std:p_queue is max heap , so pass negative distance for appropriate shortest cost and again negate it when retriving distances fom it)Question link is here Synchronomous shopping Hackerrank
•  » » » 19 months ago, # ^ | ← Rev. 2 →   +7 Firstly, why do you necropost that have already answers SecondlyYou should put your long code into the spoiler (else it causes lag and makes people annoy) ThirdlyThe blog is about comparing dijkstra implementations, which you should paste only the dijkstra code instead of pasting random code from random problem
•  » » » » 19 months ago, # ^ |   0 i already edited it. Thanks for guidance
•  » » 19 months ago, # ^ |   -22 there are ways to modify the algorithm so that you only need to process one vertex once, despite the priority queue having multiple copies of it after getting [u, du] from the queue, if du != d[u], it means that you have processed with vertex u already, so you can just skip u and continue with the next vertex in the queue
 » 19 months ago, # |   -13 Recently in a Codechef contest , i got TLE with sets ,while AC with priority queue. So ,i think pq is better.
 » 19 months ago, # |   -23 Am I right that priority queue can sometimes give wrong answers?reference — Problem from IOI 2011 "Crocodile's Underground City":Can anybody explain this, please?