Dijkstra’s algorithm computes shortest paths from a single source in a graph with non‑negative edge weights. It repeatedly picks the closest unvisited node (usually via a priority queue) and relaxes outgoing edges, achieving O((V+E) log V) time with a heap.