--- title: "#bfs articles | Hashnode" description: "Explore 84 articles tagged #bfs on Hashnode. Tutorials, guides, and how-tos from the community." url: "https://hashnode.com/tag/bfs" --- Tag # #bfs 84 posts · 1 followers [Mayank Mahajan](https://hashnode.com/@Mayank9056) · [Oct 9](https://hashnode.com/posts/maximum-width-of-a-binary-tree-counting-the-nodes-that-aren-t-there/6ac9254cb8f25ffd2bd94a31) ### [Maximum Width of a Binary Tree: Counting the Nodes That Aren't There](https://mayankdev.hashnode.dev/maximum-width-of-a-binary-tree-counting-the-nodes-that-aren-t-there?utm_source=hashnode&utm_medium=feed) A BFS story about empty positions, heap-style indexes, and why re-basing keeps your numbers small. 5 min read · [mayankdev.hashnode.dev](https://mayankdev.hashnode.dev/maximum-width-of-a-binary-tree-counting-the-nodes-that-aren-t-there?utm_source=hashnode&utm_medium=feed) [Mayank Mahajan](https://hashnode.com/@Mayank9056) · [Oct 6](https://hashnode.com/posts/binary-tree-right-side-view-one-node-per-level/6ac53d9bcaa83d2cebce552b) ### [Binary Tree Right Side View: One Node Per Level](https://mayankdev.hashnode.dev/binary-tree-right-side-view-one-node-per-level?utm_source=hashnode&utm_medium=feed) Understand LeetCode 199 once, then solve it twice with right-first DFS and level-order BFS. 10 min read · [mayankdev.hashnode.dev](https://mayankdev.hashnode.dev/binary-tree-right-side-view-one-node-per-level?utm_source=hashnode&utm_medium=feed) [Mayank Mahajan](https://hashnode.com/@Mayank9056) · [Sep 25](https://hashnode.com/posts/level-order-traversal-intuition-queue-and-bfs/6ab6f2854b863fc9db1d3f63) ### [Level Order Traversal: Intuition, Queue, and BFS](https://mayankdev.hashnode.dev/level-order-traversal-intuition-queue-and-bfs?utm_source=hashnode&utm_medium=feed) Understand level order traversal using BFS and queues, with intuition, step-by-step examples, implementation, and complexity. 5 min read · [mayankdev.hashnode.dev](https://mayankdev.hashnode.dev/level-order-traversal-intuition-queue-and-bfs?utm_source=hashnode&utm_medium=feed) [Nguyen Engineer](https://hashnode.com/@finnng) · [Jun 27](https://hashnode.com/posts/we-won-honestbee-logistics-challenge-2016/6a3feab5537cbc0ee55de90b) ### [We won Honestbee Logistics Challenge 2016](https://nguyengineer.dev/we-won-honestbee-logistics-challenge-2016?utm_source=hashnode&utm_medium=feed) Winning Honestbee’s 2016 logistics challenge in Saigon with a BFS-based delivery route optimizer 4 min read · [nguyengineer.dev](https://nguyengineer.dev/we-won-honestbee-logistics-challenge-2016?utm_source=hashnode&utm_medium=feed) [Tanya Agarwal](https://hashnode.com/@tanya2) · [Jun 6](https://hashnode.com/posts/building-a-graph-based-job-recommendation-system-using-bfs-and-dfs/6a2412583480bd6272ebc1c9) ### [Building a Graph-Based Job Recommendation System using BFS and DFS](https://tanyacodes.hashnode.dev/building-a-graph-based-job-recommendation-system-using-bfs-and-dfs?utm_source=hashnode&utm_medium=feed) Introduction Finding the right job opportunity based on a person's skills can be challenging. Many students and professionals struggle to identify career paths that align with their expertise. To addr 5 min read · [tanyacodes.hashnode.dev](https://tanyacodes.hashnode.dev/building-a-graph-based-job-recommendation-system-using-bfs-and-dfs?utm_source=hashnode&utm_medium=feed) [Saipriya M Ravi](https://hashnode.com/@saipriya-mr) · [May 10](https://hashnode.com/posts/decoding-graphs/6a002d2fe3eebc2e20435198) ### [Decoding Graphs: A Pattern-Based Guide to Mastering Network Logic](https://saipriya-builds.hashnode.dev/decoding-graphs?utm_source=hashnode&utm_medium=feed) Graphs. Using real-world examples—from Google Maps' routing to LinkedIn’s connection levels—we map common algorithmic patterns like BFS, DFS, Dijkstra’s, and MST to the problems they solve. Whether you're preparing for a technical interview or building complex software, this post provides the mental framework needed to turn messy nodes and edges into elegant, efficient solutions. 4 min read · [saipriya-builds.hashnode.dev](https://saipriya-builds.hashnode.dev/decoding-graphs?utm_source=hashnode&utm_medium=feed) [Alex Mateo](https://hashnode.com/@alexmateo) · [May 10](https://hashnode.com/posts/graph-algorithms-for-coding-interviews-when-to-use-bfs-dfs-or-dijkstra/6a004c68e3eebc2e20584ea5) ### [Graph Algorithms for Coding Interviews: When to Use BFS, DFS, or Dijkstra](https://alexmateo.hashnode.dev/graph-algorithms-for-coding-interviews-when-to-use-bfs-dfs-or-dijkstra?utm_source=hashnode&utm_medium=feed) Learn when to use BFS, DFS, or Dijkstra in coding interviews. Decision framework, complexity, and classic problems for each algorithm. 11 min read · [alexmateo.hashnode.dev](https://alexmateo.hashnode.dev/graph-algorithms-for-coding-interviews-when-to-use-bfs-dfs-or-dijkstra?utm_source=hashnode&utm_medium=feed) [Pranoti Patil](https://hashnode.com/@vibesAI) · [Feb 22](https://hashnode.com/posts/12-breadth-first-search-bfs/699aca2d09bbd76ce2cd722b) ### [12.Breadth-First Search (BFS)](https://ai-for-multidisciplinary-application.hashnode.dev/12-breadth-first-search-bfs?utm_source=hashnode&utm_medium=feed) BFS uses a Queue to keep track of which nodes to explore next. Definition BFS explores all nodes level by level starting from the root.It visits all nodes at depth 1, then depth 2, and so on.  Algorit 4 min read · [ai-for-multidisciplinary-application.hashnode.dev](https://ai-for-multidisciplinary-application.hashnode.dev/12-breadth-first-search-bfs?utm_source=hashnode&utm_medium=feed) [Junghun Kim](https://hashnode.com/@vienna453) · [Jan 6](https://hashnode.com/posts/dfs-bfs-preorder-inorder-postorder/695cf3f06f0d1c80a6a36706) ### [DFS와 BFS, 그리고 Preorder / Inorder / Postorder의 진짜 관계](https://devnote-vienna453.hashnode.dev/dfs-bfs-preorder-inorder-postorder?utm_source=hashnode&utm_medium=feed) DFS와 BFS의 차이와 관계, 각 탐색 전략의 실무 활용 사례를 설명합니다. DFS의 순회 방식, BFS의 특징 등을 다룹니다 4 min read · [devnote-vienna453.hashnode.dev](https://devnote-vienna453.hashnode.dev/dfs-bfs-preorder-inorder-postorder?utm_source=hashnode&utm_medium=feed) [Bikash Mainali](https://hashnode.com/@bikash8848) · [Jan 6](https://hashnode.com/posts/breadth-first-search-bfs-for-undirected-unweighted-graph/695c6acd3313a602923f1c52) ### [Breadth First Search (BFS): for Undirected Unweighted Graph](https://dsa-3956.hashnode.dev/breadth-first-search-bfs-for-undirected-unweighted-graph?utm_source=hashnode&utm_medium=feed) BFS Traversal — 4 Easy Rules Rule 1 — Start Put the starting vertex into a queue. Keep an empty visited set. Rule 2 — Take from Queue While the queue is not empty: Remove the front vertex from the queue. ⚠️ Key difference from BFSBFS → Queu... 6 min read · [dsa-3956.hashnode.dev](https://dsa-3956.hashnode.dev/breadth-first-search-bfs-for-undirected-unweighted-graph?utm_source=hashnode&utm_medium=feed)