Dijkstra’s algorithm is a method to calculate the shortest path from one node to another with weighted edges. It does not work for negative edge weights, however. Fun fact: it is a main algorithm used in Google Maps. It starts off by setting all the distances of each node to…
