S8:E4 - "DAG, Daniel! Back at it again..."

We end our section of the DFS algorithm with a discussion on DAGs (directed acyclic graphs), because most implementations of depth-first search will check to see if any cycles exist, and a large part of that is based on the DFS algorithm checking to see whether or not a graph is a directed acyclic graph. DAGs are also somewhat infamous in computer science because they’re pretty much everywhere in sofware. For example, a directed acyclic graph is the backbone of applications that handle scheduling for systems of tasks or handling jobs — especially those that need to be processed in a particular order. So let's dig into DAGs! Based on Vaidehi Joshi's blog post, "Spinning Around In Cycles With Directed Acyclic Graphs".

You can listen to S8:E4 - "DAG, Daniel! Back at it again..." online on Radio and Podcast. Open the player on this page to stream the available audio.

S8:E4 - "DAG, Daniel! Back at it again..." is an episode from Base.cs Podcast by Base.cs Podcast.

This episode is 00:13:25 long.

This episode was published on Nov 6, 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.