1,315 views
0 votes
0 votes
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

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
1
Debargha Mitra Roy asked Apr 16
157 views
#include <stdio.h int main() { int a[3] = {1, 3, 5, 7, 9, 11}; int *ptr = a[0]; ptr += sizeof(int); printf("%d", *ptr); return 0; }(Assume size of int to be $2$ bytes.)T...
0 votes
0 votes
1 answer
2
Mrityudoot asked Feb 25
202 views
How can we find the highest element in a singly linked list in O(1)? We are free to use any extra space.
0 votes
0 votes
1 answer
3
tishhaagrawal asked Dec 16, 2023
392 views
Below is my approach to solving this question, can anyone please explain if I am doing it the right way?Let X = #free slotssince, m =7 and n = 3So, $4 \leqslant x\leqsla...
2 votes
2 votes
1 answer
4
divinedrug asked Oct 27, 2023
318 views
When it comes to Gate Data Science and AI, what language will the DSA questions be asked in - Python or C language?