Dijkstra, Weighted Graph, Data Structure Algorithm, Algorithms, Graph Data Structure.
the blocks in yellow colour, named start and end respectively. As you can see for yourself the possible routes to traverse have a numeric along it which is the weight of the edge. For this graph, you may be able to find out the optimal path by trial and error method as it’s a sparse graph. But what