Concours Centrale-Supélec
Informatique Et Sciences IndustriellesEnglish
Exam overviewPractice session
In algorithmics, Dijkstra's single-source shortest path algorithm is executed on a weighted directed graph G = (V, E) with non-negative edge weights using a binary min-heap priority queue. What is the optimal worst-case time complexity of the algorithm, and why does Dijkstra's algorithm fail if some edge weights are negative?
Loading your practice session…