The maximum number of times the decrease key operation performed in Di – McqOptions

MCQOPTIONS

1.	The maximum number of times the decrease key operation performed in Dijkstra's algorithm will be equal to ___________
A.	Total number of vertices
B.	Total number of edges
C.	Number of vertices - 1
D.	Number of edges - 1
Answer» C. Number of vertices - 1

Discussion

No Comment Found

Related MCQs

Dijkstra's Algorithm cannot be applied on ______________
Dijkstra's Algorithm is the prime example for ___________
Dijkstra's Algorithm run on a weighted, directed graph G={V,E} with non-negative weight function w and source s, terminates with d[u]=delta(s,u) for all vertices u in V.
Which of the following is the most commonly used data structure for implementing Dijkstra's Algorithm?
Floyd Warshall's Algorithm is used for solving ____________
Dijikstra's Algorithm is more efficient than Bellmann Ford Algorithm.
Using logical operator's instead arithmetic operators saves time and space.
Dijkstra's Algorithm is used to solve _____________ problems.
What is running time of Dijkstra's algorithm using Binary min- heap method?
Consider the following graph: What is the minimum cost to travel from node A to node C