Question: Which algorithm is used to find the shortest path in a graph?A ) Depth - First SearchB ) Breadth - First SearchC ) Dijkstra's AlgorithmD
Which algorithm is used to find the shortest path in a graph?A DepthFirst SearchB BreadthFirst SearchC Dijkstra's AlgorithmD Kruskal's Algorithm
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
