In case of Dijkstra's algorithm (one of the implementations of the link-state…
In case of Dijkstra's algorithm (one of the implementations of the link-state algorithm), if n is the number of nodes (excluding the source), how many number of nodes does one need to search in the worst case through all the iterations?
- A.
n²
- B.
n(n+1)/2
- C.
n³
- D.
n²logn
Attempted by 298 students.
Sign up free to check your answer
Sign up freeLoading lesson…