Question

John wants to go to different locations of the city in which he is. He has listed all of them

down.However he wants to visit one location before visiting some other location What

application of graphs he uses to determine that location?

A. DFS

B. Dijkstra’s

C. BFS

D. Topological Sorting​

Answer 1

Answer:

B. Dijkstra’s

Explanation: Dijkstra’s is the correct answer.

Answer 2

"D: Topological Sorting​".

Explanation :  

From topological sorting, it is the way to do tasks in a prescribed order. So, if he does topological sorting, it will be comfortable for him to identify what should be the order to visit other places.

Depth-first search(DFS) used in topological sorting for  scheduling problems, cycle detection in graphs, and also solving puzzles with only one solution

Dijkstra's algorithm is an algorithm used in finding the shortest paths between nodes in a graph.

Breadth-First Search(BFS) is a vertex-based technique used in finding the shortest path in the graph.