← All courses
🕸️Advanced

Graphs

Model anything as nodes and edges: representations, breadth-first and depth-first search, cycle detection, topological sort, union-find, and shortest-path algorithms (BFS, Dijkstra, and friends).

Volume 4 · Part VI · 8 chapters · 8 lessons
Share

What you'll learn

  • Graph Representations
  • Breadth-First Search
  • Depth-First Search
  • Cycle Detection
  • Topological Sort
  • Union-Find
  • Shortest Paths (Dijkstra)
  • Graph Problem Patterns

Curriculum

3 modules · 8 lessons
Module 1Foundations3 lessons
Graph RepresentationsPreview
Breadth-First Search
Depth-First Search
Module 2Structure & Order3 lessons
Cycle Detection
Topological Sort
Union-Find
Module 3Paths & Patterns2 lessons
Shortest Paths (Dijkstra)
Graph Problem Patterns

Reviews

No reviews yet.

More courses

Browse all →