HackMD
Graph Study Guide
Graph Representation and Traversal
HashMap
Connected Components
Union Find
- 🟨 261. Graph Valid Tree [Solution]
- 🟨 323. Number of Connected Components in an Undirected Graph [Solution]
- 🟨 547. Number of Provinces [Solution]
- 🟨 684. Redundant Connection [Solution]
- 🟧 721. Accounts Merge [Solution]
Graph Search Algorithms
Depth-First Search (DFS)
- 🟨 200. Number of Islands [Solution]
- 🟨 695. Max Area of Island [Solution]
- 🟩 733. Flood Fill [Solution]
Breadth-First Search (BFS)
- 🟥 127. Word Ladder
- 🟨 542. 01 Matrix [Solution]
- 🟨 909. Snakes and Ladders [Solution]
- 🟨 994. Rotting Oranges [Solution]
Special Search Problems
- 🟨 417. Pacific Atlantic Water Flow [Solution]
- 🟨 130. Surrounded Regions [Solution]
- 🟥 329. Longest Increasing Path in a Matrix
- 🟨 863. All Nodes Distance K in Binary Tree
- 🟨 1197. Minimum Knight Moves
- 🟨 1730. Shortest Path to Get Food
Shortest Path Problems
Single Source Shortest Path (SSSP)
All Pairs Shortest Path
Floyd–Warshall Algorithm
Bellman-Ford Algorithm
Minimum Spanning Tree (MST)
- 🟨 1135. Connecting Cities With Minimum Cost
- Prim's Algorithm
- Kruskal's Algorithm
Topological Sorting
- 🟥 269. Alien Dictionary
- 🟨 207. Course Schedule
- 🟨 210. Course Schedule II
- 🟨 310. Minimum Height Trees
Directed Graph Problems
Advanced Graph Topics
- 🟥 1192. Critical Connections in a Network
- Strongly Connected Components (SCC)
- Tarjan's Algorithm
- Kosaraju's Algorithm
- Eulerian Path
- Travelling Salesman Problem (TSP)
- Hamiltonian Path
Problem Difficulty Legend
- 🟩 Easy
- 🟨 Medium
- 🟧 Medium-Hard
- 🟥 Hard
- ⬛ Very Hard
