Graph Algorithms (Part 1.0): Dijkstra's Shortest Path [Concept]

@pry0cc, there is a routing protocol known as OSPF where “SPF” stands for Shortest Path First. It’s used almost everywhere and the algorithm behind it is Dijkstra’s. Even though its networking implementation is confusing, I highly recommend looking it up so you can understand the high-level image at least. It’s quite interesting.

1 Like