Which algorithm will be the most efficient to find out the shortest path between two given nodes in an undirected weighted graph?

Which algorithm will be the most efficient to find out the shortest path between two given nodes in an undirected weighted graph?

a) Breadth First Search
b) Depth First Search
c) Dijkstra's algorithm
d) Floyd-Warshall algorithm

From the Combined Bank Assistant Programmer (CSE) 2020 – Preliminary (DU) exam, question 36 of 47.

More from this paper

Previous: How many function calls will be performed to execute the following recursive function? void function(int N){ if(N==0) return…
Next: Which HTML attribute is used to hide characters of an input password?
All questions in Combined Bank Assistant Programmer (CSE) 2020 – Preliminary (DU)