Dijkstr
Dijkstra refers to a family of algorithms used in graph theory to find the shortest path between two nodes in a graph. The most famous of these is Dijkstra's algorithm, named after its inventor, Edsger W. Dijkstra. This algorithm finds the shortest path from a single source node to all other nodes in a graph with non-negative edge weights. It works by iteratively exploring the graph, maintaining a set of visited nodes and the shortest known distance from the source to each node. At each step, it selects the unvisited node with the smallest current distance and adds it to the visited set, updating the distances of its neighbors.
Dijkstra's algorithm is a greedy algorithm, meaning it makes locally optimal choices at each step in the