S8:E5 - "Dijkstra's algorithm is a weighty topic"
Nov 13, 2019•26 min•Transcript available on Metacast Episode description
In this episode, we 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. It's super important, and you'll see why when you learn about the weighted graph! Based on Vaidehi Joshi's blog post, "Finding The Shortest Path, With A Little Help From Dijkstra".
