PDSA · WEEK 4
Graphs, traversal and DAGs.
Build graph representations, explore with BFS and DFS, and solve ordering and longest-path problems in DAGs.
8 study sections14 illustrations1 revision page
Start Lesson 1 →Study sections
Follow the order or choose a section01
Introduction to Graphs
Graphs
02Representing Graphs — Adjacency Matrix and Adjacency List
Graphs
03Breadth First Search (BFS)
Exploring graphs
04Depth First Search (DFS)
Exploring graphs
05Applications of BFS and DFS
Exploring graphs
06Directed Acyclic Graphs (DAGs)
Directed acyclic graphs
07Topological Sorting
Directed acyclic graphs
08Longest Path in a DAG
Directed acyclic graphs