Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsShortest path algorithms

Dijkstra's algorithm

Running time

Report a typo

For a graph $G$ with $n$ nodes and $m$ edges, the array-based implementation of Dijkstra's algorithm works in ... If a priority queue (implemented via a binary heap) is used, then the algorithm runs in ...

Select one option from the list

O(n^2 + m)

O(n + m)

O(m^2 + n)

O((n + m) \cdot \log m)

O(n^2 + m)

O(m^2 \cdot \log m)

O(n^2 + m)

O((n + m) \cdot \log n)

___

Create a free account to access the full topic