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

You can listen to S8:E1 - "Getting deep with depth-first search" online on Radio and Podcast. Open the player on this page to stream the available audio.

S8:E1 - "Getting deep with depth-first search" is an episode from Base.cs Podcast by Base.cs Podcast.

This episode is 00:25:34 long.

This episode was published on Oct 16, 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.