Dijkstra’s algorithm is the most popular algorithm to find the shortest paths from a certain vertex in a weighted graph.In fact, the algorithm will find the shortest paths to every vertex from the start vertex.The algorithm takes both greedy and dynamic programming approach that it will try to find local optimum paths first and use them to find the shortest paths.Let’s take a look at how it works! How does Dijkstra’s algorithm work? Let’s say we need to find the shortest path from node A to node E. There are five nodes and each edge is weighted with the cost READ MORE