Base.cs Podcast

S8:E6 - "Getting deeper into Dijkastra"

av Base.cs Podcast | Publicerades 11/20/2019

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.

Om Podcasten

Beginner-friendly computer science lessons based on Vaidehi Joshi's base.cs blog series, produced by CodeNewbie.