S8:E6 - "Getting deeper into Dijkastra"
Nov 20, 2019•29 min•Transcript available on Metacast Episode description
We continue our talk about Dijkstra's algorithm, which can be used to determine the shortest path from one node in a graph to every other node within the same graph data structure, provided that the nodes are reachable from the starting node. Based on Vaidehi Joshi's blog post, "Finding The Shortest Path, With A Little Help From Dijkstra".
