Quick practice
Question 1 of 5
It is observed that in the unweighted graph, the shortest path from node S to every node is calculated in terms of time complexity. So, by which of the following process, time complexity can be obtained?
A
Dijkstra’s algorithm starting from S.
B
Warshall’s algorithm
C
Performing a BFS starting from S.
D
Performing a DFS starting from S.
Get unlimited practice with GATE - CSIT, DSAI & Interview Preparation subscription
Boost your performance with adaptive practice tests
Practice every concept in the syllabus
Compare your speed and accuracy with your peers
Download the app and practice on the go