(Solved): Dijkstra's single Shortest Path algorithm has running time in terms of number of vertices \( n \) ...

Dijkstra's single Shortest Path algorithm has running time in terms of number of vertices \( n \) with number of edges \( k \sim n \) \( O(n) \) \( \mathrm{O}(\lg (\mathrm{n})) \) \( \mathrm{O}\left(\mathrm{n}^{*} \lg (\mathrm{n})\right) \) other \( O\left(n^{\wedge} 2\right) \) \( \mathrm{O}\left(\mathrm{n}^{\wedge} 2^{*} \lg (n)\right) \) \( O\left(n^{\wedge} 3\right) \)