In an weighted, directed connected graph, the shortest path between every pair of nodes in graph is computed most efficiently in terms of running time complexity, is given by which of the following algorithm?
a)DFS algorithm
b)Dijkstra’s algorithm
c)Bellman-ford algorithm
d)Floyd-Warshall algorithm
