intermediate level
Graphs & Graph Algorithms
Study Material for Graphs & Graph Algorithms
Ch 21: Graph Representation, DFS & BFS
Graph Terminology · Graph Representation · DFS on Graphs · BFS on Graphs · Connected Components · Grid Traversal
Ch 22: Cycle Detection, Bipartite Checking & Topological Sort
Cycle Detection in Undirected Graphs · Cycle Detection in Directed Graphs · Bipartite Checking · Topological Sort · DAG Reasoning · Functional Graphs
Ch 23: Dijkstra, 0-1 BFS & Kruskal's MST
Dijkstra's Algorithm · 0-1 BFS · Minimum Spanning Tree — Kruskal's Algorithm
Ch 24: Rooted Trees — DFS, Subtree Size & Diameter
Tree Terminology · Rooting a Tree · Tree Diameter · Distance Between Two Vertices · Tree Algorithms: Summary of Techniques
Ch 25: Binary Lifting, LCA & Euler Tour
Binary Lifting · Lowest Common Ancestor (LCA) · Euler Tour
Related Topics
Was this helpful?
Published by RunTimeFix · Comprehensive guides for competitive programming