S8:E1 - "Getting deep with depth-first search"

We ended last season by starting 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. Now we begin our new season with depth-first search (DFS), which also helps us determine one (of sometimes many) paths between two nodes in the graph, but this time by traversing down one single path in a graph, until we can't go any further, checking one child node at a time. Based on Vaidehi Joshi's blog post, "Deep Dive Through A Graph: DFS Traversal".

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