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.

Here you can find additional resources:

- Graphs
- Sample graph representation
- Implementation of DFS
- Implementation of BFS
- Abstract syntax trees (AST)
- Applications of graphs for garbage collection
- Prefetching of partials

**Transcript**