S7:E8 - "Delivering muffins with BFS"


Manage episode 241828698 series 1714497
By Base.cs Podcast. Discovered by Player FM and our community — copyright is owned by the publisher, not Player FM, and audio is streamed directly from their servers. Hit the Subscribe button to track updates in Player FM, or paste the feed URL into other podcast apps.

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

A huge thank you to Educative for sponsoring this season of the show!


The comprehensive and interactive text-based courses give you in-demand tech skills. Get 20% off by going to educative.io/BaseCS

We're on Patreon!

If you like the show and want to support our work, become a patron here. You'll get stickers, postcards, and even socks. Let's make computer science more accessible and fun!

Vaidehi Joshi (co-host)

Vaidehi is a writer and an engineer at Tilde, where she works on Skylight. She's the creator of basecs, a weekly writing series that explores the fundamentals of computer science.

Saron Yitbarek (co-host)

Saron is a developer, podcaster, founder of CodeNewbie, and host of the CodeNewbie Podcast.


CodeNewbie is the most supportive community of programmers and people learning to code. They produce the CodeNewbie Podcast and the annual Codeland conference. Follow them on twitter @CodeNewbies. For more info, checkout www.codenewbie.org

66 episodes