Dijkstra’s in DisguiseEric JangAugust 12, 2018Keywords: Graph Theory, Finance, Reinforcement Learning, Computer
GraphicsA 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,
and we express this cost function as Lu(v).Figure 1: For example, if each edge in this graph has cost 1, Lu(v) = 3.Dijkstra’s, Bellman-Ford, Johns
