Multiple choice

In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity, by

  1. applying Dijkstra’s algorithm starting from S

  2. applying Warshall’s algorithm

  3. performing a DFS starting from S

  4. performing a BFS starting from S

Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Keep practicing — related questions