S8:E5 - "Dijkstra's algorithm is a weighty topic"

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".

You can listen to S8:E5 - "Dijkstra's algorithm is a weighty topic" online on Radio and Podcast. Open the player on this page to stream the available audio.

S8:E5 - "Dijkstra's algorithm is a weighty topic" is an episode from Base.cs Podcast by Base.cs Podcast.

This episode is 00:26:07 long.

This episode was published on Nov 13, 2019.

Yes. Use the heart button on the episode page to add it to your favorite episodes list.

Yes. This page shows related episodes from Base.cs Podcast when more episodes are available from the podcast feed.