5
Graph Algorithms
4 lessons in this module
0 of 4 topics completed
🟢
#21Graph Representations
Different ways to represent graphs: adjacency list, adjacency matrix, and edge list.
Start Lesson
🟡
#22Breadth-First Search (BFS)
Graph traversal algorithm that explores nodes level by level using a queue.
Start Lesson
🟡
#23Depth-First Search (DFS)
Graph traversal algorithm that explores as far as possible along each branch before backtracking.
Start Lesson
🟡
#24Topological Sort
Linear ordering of vertices in a DAG such that for every edge (u, v), u comes before v.
Start Lesson