# Graphs, and Choosing Well

Graphs, breadth-first and depth-first search, shortest paths and topological sort, then choosing the right structure and solving a problem out loud.

Updated: November 17, 2026

## Chapters

- [Graphs](https://www.ask-codey.com/courses/data-structures/chapters/ds-graphs) (3 topics, 5 lessons)
- [Graphs at Work](https://www.ask-codey.com/courses/data-structures/chapters/ds-graphs-at-work) (2 topics, 3 lessons)
- [Choosing Well](https://www.ask-codey.com/courses/data-structures/chapters/ds-choosing-well) (3 topics, 4 lessons)

Source: https://www.ask-codey.com/courses/data-structures/modules/7
