Dijkstra's algorithm

This algorithm is used to find the shortest path between two nodes in a graph with weighted edges.