Skip to content
Episode 6 - Graphs and Graph Traversal episode artwork

Feb 4, 2020 21 min

Episode 6 - Graphs and Graph Traversal

from Programming Hosted by Minko Gechev

In this episode, we'll discuss graphs. You'll learn how this data structure looks like and what are its applications. Later on, we'll talk about algorithms for traversing graphs. You'll understand how breadth-first search and depth-first search work and when you should use one instead of the other. Topics we'll also touch on are chromatic graphs and finding the shortest path.

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

Episode 6 - Graphs and Graph Traversal

0:00 21:35

No transcript yet.

Requests help us decide what to transcribe next.

Frequently asked questions

How long is this episode of Programming?

This episode is 21 minutes long.

When was this Programming episode published?

This episode was published on February 4, 2020.

Can I download this Programming episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.