S8:E6 - "Getting deeper into Dijkastra"

We use Dijkstra's algorithm to find the shortest path from one node to another in a complicated house-shaped graph. Also, Viadahi sings us a song.