> [!tldr] Famous [[Graph Database]] search algorithm Dijkstra's algorithm is a **shortest path** algorithm for a weighted graph. Starting from a given node, Dijkstra's algorithm will guaranteedly find the shortest possible path to every other node. It's just not, necessarily, the fastest to *compute*. **** # More ## Source - https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm - https://www.youtube.com/watch?v=kS-CGkiPetQ: -