6d ago · 16 min read · TLDR: DFS explores a graph by diving as deep as possible along each path before backtracking, using a call stack (recursion) or an explicit stack. It is the go-to algorithm for cycle detection, path finding, topological sort, and connected components...
Join discussion6d ago · 17 min read · TLDR: BFS explores a graph level by level using a FIFO queue, guaranteeing the shortest path in unweighted graphs. Recognize BFS problems by keywords: "shortest path," "minimum steps," or "level order." Time: O(V + E). Space: O(V). Mark nodes visited...
Join discussionMar 7 · 4 min read · Anyone who has travelled in the Delhi Metro knows an interesting fact: The shortest route is not always the best route. A path with fewer stations can feel worse if it requires multiple interchanges.A slightly longer route can feel easier if you st...
Join discussionNov 6, 2025 · 3 min read · The Desmos Calculator has become an essential tool for students, teachers, and anyone who works with mathematics. It is known for its ability to turn equations into clear and dynamic visual graphs, helping users understand mathematical concepts more ...
Join discussion
Aug 22, 2025 · 3 min read · The Graph → The Python code to find the shortest path in the above ⬆️ graph → from collections import deque from typing import List, Tuple, Optional def bfs(n: int, graph: List[List[int]], source: int) -> Tuple[List[float], List[int]]: """ ...
Join discussion
Aug 19, 2025 · 7 min read · Sharing some topic wise good Graph problems and sample solutions to observe on how to approach. Union Find: Identify if problems talks about finding groups or components. https://leetcode.com/problems/friend-circles/ https://leetcode.com/problems/...
Join discussion
Jul 20, 2025 · 3 min read · The rhythm broke before the rule did. Not because something was missing — but because something repeated, when it shouldn’t have. The Shape That Shouldn’t Exist It was March 2025. A junior analyst at the European Anti-Fraud Office leaned forward....
Join discussion
Jul 15, 2025 · 6 min read · When to Use BFS vs DFS Use BFS when: Shortest Path in Unweighted Graphs - BFS guarantees the shortest path because it explores nodes level by level Level-order Traversal - When you need to process nodes level by level Finding Minimum Steps - Any pro...
Join discussion
Jul 6, 2025 · 10 min read · Reflecting on the Ant Colony Analogy: Traversing Graphs, Colony Style Over the past articles, we’ve embarked on an adventure through the world of graph theory with the help of our hardworking colony of ants. These tiny explorers taught us how to tack...
Join discussion
Jul 5, 2025 · 12 min read · Introduction to Full Colony Exploration In an ant colony, paths are frequently traversed as ants carry out daily tasks, from food gathering to defending the Queen’s chamber. But what if an ant wanted to explore the entire colony, covering every singl...
Join discussion
