Dijkstra's algorithm: set or priority_queue?

Revision en1, by Diplomate, 2016-09-20 15:43:13

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?

Tags std, stl, dijkstra, set priority queue


  Rev. Lang. By When Δ Comment
en1 English Diplomate 2016-09-20 15:43:13 299 Initial revision (published)