Dijkstra, Weighted Graph, Data Structure Algorithm, Algorithms, Graph Data Structure.
Dijkstra and A*. Both are similar algorithms used to find paths in a weighted graph. A* is basically based on the same idea as Dijkstra, but with a little twist to it. So without any further ado, let’s jump into the intricate, intimidating, yet fun world of algorithms. Dijkstra Dijkstra’s algorithm