Glossary term
What is Dijkstra's algorithm? Meaning for developers
Shortest paths from one start when all edge weights are zero or more. It always expands the closest unfinished vertex, using a priority queue.
Learn it properly · DSALesson 52: Shortest PathsBFS when all steps cost the same, Dijkstra for other costs, and Bellman–Ford for limits.