Data Structure Algorithm, Programming, Dijkstras Algorithm, Bellman Ford Algorithm, Graph.
and navigation within virtual worlds. Robotics and Autonomous Vehicles: path planning for robots or autonomous vehicles. From the above applications, different shortest path algorithms are required to solve. Then, this article will discuss the standard techniques: Dijkstra's and Bellman-Ford's