# Tag Archives: Algorithms-Graph Shortest Paths Quiz

Which of the following algorithm can be used to efficiently calculate single source shortest paths in a Directed Acyclic Graph? (A) Dijkstra (B) Bellman-Ford (C)… Read More
Following statement is true or false? If we make following changes to Dijkstra, then it can be used to find the longest simple path, assume… Read More
In a weighted graph, assume that the shortest path from a source ‘s’ to a destination ‘t’ is correctly calculated using a shortest path algorithm.… Read More
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices? (A) (B) (C) (D) Answer: (C) Explanation:… Read More
Suppose we run Dijkstra’s single source shortest-path algorithm on the following edge weighted directed graph with vertex P as the source. In what order do… Read More
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… Read More
Dijkstra’s single source shortest path algorithm when run from vertex a in the below graph, computes the correct shortest path distance to (A) only vertex… Read More
To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is: (A) Queue… Read More
Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by… Read More