Techniques/Dijkstra

For when the algorithm is more than just a graph theory thing

This is a page for the Dijkstra algorithm, a graph theory thing that's not just for graph theory. The algorithm itself is a bit of a doozy, but trust us, it's worth it. Read about the algorithm itself, if you're feeling brave. Or if you'd rather not, you could check out the implementation of the algorithm, because who doesn't love a good "as-the-code-is-written" story? Or maybe you're just curious about the variants of Dijkstra, because who doesn't love a good graph theory party? Or perhaps you're looking for something more practical? In that case, check out the applications of Dijkstra, because, let's be real, who doesn't love a good "it's-used-in-the-real-world" story?