Dijkstra’s Algorithm

A graph search algorithm that finds the shortest path between nodes in a graph where edge weights are non-negative. It iteratively explores the graph, maintaining a set of visited nodes and distances from the starting node until the shortest paths to all reachable nodes are determined.