Source Map — 09 Graphs¶
এই folder-এর প্রতিটা idea, link, আর problem reference — তার উৎস আর copying status সহ। এই repo-র problem description গুলো সবসময় আমাদের নিজেদের ভাষায় নতুন করে লেখা; link গুলো official statement-এ নিয়ে যায়।
| Concept / Problem | Source Type | Source Name | Link | How it is used | Copying status |
|---|---|---|---|---|---|
| City road map analogy | Original | This repo | — | concept.md-এর opening analogy | original explanation |
| Adjacency list vs matrix trade-offs | Textbook-common knowledge | Standard CS curriculum; see also Open Data Structures | উৎস খুলুন | concept.md-এর memory picture আর table | original explanation |
| BFS algorithm and shortest-path property | Reference write-up | cp-algorithms, Breadth-First Search | উৎস খুলুন | bfs.md-এর background; আমাদের text স্বাধীন | original explanation |
| DFS, colors, entry/exit times | Reference write-up | cp-algorithms, Depth-First Search | উৎস খুলুন | dfs.md-এর background; আমাদের text স্বাধীন | original explanation |
| Dijkstra algorithm and proof idea | Reference write-up | cp-algorithms, Dijkstra | উৎস খুলুন | shortest-path.md-এর background; আমাদের text স্বাধীন | original explanation |
| Topological sort (Kahn + DFS post-order) | Reference write-up | cp-algorithms, Topological Sorting | উৎস খুলুন | topological-sort.md-এর background; আমাদের text স্বাধীন | original explanation |
| BFS wave / DFS string-in-cave framing | Original | This repo | — | visual-explanation.md-এর frames আর traces | original explanation |
| 0-1 BFS deque idea | Competitive-programming folklore | Covered on cp-algorithms and USACO Guide | উৎস খুলুন | shortest-path.md-এ একটা row + intuition | original explanation |
| Bellman-Ford sketch | Textbook-common knowledge | Standard CS curriculum | উৎস খুলুন | shortest-path.md-এর সংক্ষিপ্ত sketch | original explanation |
| Interactive graph animations | Visualizer | VisuAlgo (traversal, SSSP modules) | উৎস খুলুন | README.md আর visual-explanation.md-এ recommend করা | official link only |
| Number of Islands | Online judge | LeetCode 200 | উৎস খুলুন | Practice list + dfs.md-এর example | rewritten problem |
| Number of Provinces | Online judge | LeetCode 547 | উৎস খুলুন | Practice list; DSU-র দিকে bridge | rewritten problem |
| Rotting Oranges | Online judge | LeetCode 994 | উৎস খুলুন | Multi-source BFS-এর example | rewritten problem |
| Clone Graph | Online judge | LeetCode 133 | উৎস খুলুন | Practice list + dfs.md | rewritten problem |
| Course Schedule / Course Schedule II | Online judge | LeetCode 207 / 210 | উৎস খুলুন | Cycle detection + topo sort-এর examples | rewritten problem |
| Flood Fill | Online judge | LeetCode 733 | উৎস খুলুন | dfs.md-এর flood-fill section | rewritten problem |
| 01 Matrix | Online judge | LeetCode 542 | উৎস খুলুন | Multi-source BFS practice | rewritten problem |
| Pacific Atlantic Water Flow | Online judge | LeetCode 417 | উৎস খুলুন | Reverse-flood example | rewritten problem |
| Network Delay Time | Online judge | LeetCode 743 | উৎস খুলুন | Dijkstra practice | rewritten problem |
| Is Graph Bipartite? | Online judge | LeetCode 785 | উৎস খুলুন | Coloring practice | rewritten problem |
| Word Ladder | Online judge | LeetCode 127 | উৎস খুলুন | Implicit-graph BFS practice | rewritten problem |
| Alien Dictionary | Online judge | LeetCode 269 | উৎস খুলুন | Topo-sort modeling practice | rewritten problem |
| Cheapest Flights Within K Stops | Online judge | LeetCode 787 | উৎস খুলুন | Bellman-Ford-flavor practice | rewritten problem |
| Bus Routes | Online judge | LeetCode 815 | উৎস খুলুন | "What are my states?" example | rewritten problem |
| Swim in Rising Water | Online judge | LeetCode 778 | উৎস খুলুন | Minimax Dijkstra practice | rewritten problem |
| Path With Minimum Effort | Online judge | LeetCode 1631 | উৎস খুলুন | Dijkstra-variant pointer | rewritten problem |
| Longest Increasing Path in a Matrix | Online judge | LeetCode 329 | উৎস খুলুন | DP-on-DAG teaser pointer | rewritten problem |
| Find Center of Star Graph / Find if Path Exists | Online judge | LeetCode 1791 / 1971 | উৎস খুলুন | Practice list-এর easy warm-ups | rewritten problem |
| Shortest Routes I | Online judge | CSES task 1671 | উৎস খুলুন | CP scale-এ Dijkstra | rewritten problem |
| Building Roads | Online judge | CSES task 1666 | উৎস খুলুন | Components practice | rewritten problem |
| Labyrinth | Online judge | CSES task 1193 | উৎস খুলুন | Grid BFS + path reconstruction | rewritten problem |
| Building Teams | Online judge | CSES task 1668 | উৎস খুলুন | Bipartite coloring practice | rewritten problem |
| Course Schedule (CSES) | Online judge | CSES task 1679 | উৎস খুলুন | CP scale-এ topo sort | rewritten problem |
| General CP graph ladder | Online judge | Codeforces problemset / USACO Guide | উৎস খুলুন | CP-connection sections | official link only |