Dijkstra's in Disguise

A weighted graph is a data structure consisting of some vertices and edges, and each edge has an associated cost of traversal. Let's suppose we want to compute the shortest distance from vertex u to every other vertex v in the graph... By Eric Jang.

https://blog.evjang.com