S7:E8 - "Delivering muffins with BFS"

In this episode, we start our discussion of searching, or traversing, through a graph with breadth-first search (BFS). The breadth-first search algorithm traverses broadly into a structure, by visiting neighboring sibling nodes before visiting children nodes. The power of using breadth-first search to traverse through a graph is that it can easily tell us the shortest way to get from one node to another, which you'll experience first hand by brining muffins to your neighbors! Based on Vaidehi Joshi's blog post, "Going Broad In A Graph: BFS Traversal".

You can listen to S7:E8 - "Delivering muffins with BFS" online on Radio and Podcast. Open the player on this page to stream the available audio.

S7:E8 - "Delivering muffins with BFS" is an episode from Base.cs Podcast by Base.cs Podcast.

This episode is 00:23:01 long.

This episode was published on Sep 11, 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.