0 votes 0 votes The maximum number of times the decrease key operation performed in Dijkstra’s algorithm will be equal to ______________. Total number of vertices Total number of edges Number of vertices $ – 1$ Number of edges $ – 1$ Others nielit2021dec-scientistb + – soujanyareddy13 asked Dec 7, 2021 • edited Dec 14, 2021 by soujanyareddy13 soujanyareddy13 640 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes B). Total number of edges .. If the total number of edges in all adjacency list is E , then there will be a total of E number of iterations. Hence there will be a total of at most E decrease key operations.... 22 answered Feb 14, 2022 22 comment Share Follow See all 0 reply Please log in or register to add a comment.