Dijkstra’s algorithm is an algorithm for finding the shortest paths between nodes in a graph.