#breadth-fist-search articles

JKJunghun Kimdevnote-vienna453.hashnode.devJan 6 · 4 min read

DFS와 BFS, 그리고 Preorder / Inorder / Postorder의 진짜 관계

트리나 그래프를 공부하다 보면 항상 함께 등장하는 개념이 있다. DFS / BFS Preorder / Inorder / Postorder 이 둘은 자주 묶여 설명되지만, 실제로는 역할과 레벨이 다르다.이번 글에서는 다음 질문들에 답하는 흐름으로 정리해본다. DFS는 왜 순회 방식이 3가지로 나뉘는가? 순회 코드는 같은데 visit 위치만 다른 건가? BFS에는 왜 preorder / postorder 같은 개념이 없는가? 실무에서...

0

AHAnni Huanghuanganni.hashnode.devJul 16, 2025 · 9 min read

When Depth-First Search Gets It Wrong: Shortest Path Problem Analysis

While working on a recent graph traversal problem, I made an assumption that would prove costly: that Depth-First Search (DFS) and Breadth-First Search (BFS) are interchangeable algorithms. This misconception led me down a rabbit hole of debugging be...

0

AHAnni Huanghuanganni.hashnode.devJul 15, 2025 · 6 min read

Can we always change BFS solution to DFS solution?

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...

0

GKgayatri kumargeekee.hashnode.devJun 13, 2025 · 10 min read

Ants Spreading Out: Understanding Breadth-First Search

Introduction: Ants Spreading Out – What is BFS? Imagine an ant colony where the ants start from the Queen’s chamber and spread out to explore the colony. They do this in waves: first exploring all chambers directly connected to the Queen, then moving...

0

TKTennis Kumar Cleetcode-journey.hashnode.devMar 24, 2025 · 2 min read

Progress Review for Days 21 & 22 and Strategic DevOps Roadmap Planning

Day 21: Tackling Binary Tree Problems On Day 21, I focused on solving Medium-level problems related to Binary Trees. These problems helped me strengthen my understanding of DFS, BFS, and recursion. Here’s a quick rundown: Binary Tree Right Side View...

0

ABAaqib Bashir Mirbreadth-first-search.hashnode.devDec 9, 2024 · 3 min read

Breadth-First Search (BFS): A Beginner's Guide.

What is BFS? Breadth-First Search (BFS) is a graph traversal algorithm used to explore nodes and edges of a graph. It starts at a given source node and explores all its neighbors before moving on to the neighbors of those neighbors. BFS guarantees fi...

0

PGPawan Gangwaniblogs.pgangwani.co.inNov 11, 2024 · 5 min read

Crafting Graphs in TypeScript: A Comprehensive Guide to Building and Traversing Data Structures

Graphs are powerful data structures used to model relationships in data, from social networks and navigation systems to dependency tracking and recommendation engines. In this guide, we’ll create a graph in TypeScript, implementing basic operations l...

0

MSMichael Strombergmjstromberg.hashnode.devOct 19, 2024 · 10 min read

Solving the “Number of Islands” Problem in JavaScript

Photo by Cyrus Crossan on Unsplash Algorithmic problem-solving is central to coding interviews, especially for software engineering roles at major tech companies like Google, Facebook, and Amazon. While these challenges might not fully reflect day-to...

0

MPMichael Piperpipermichael.comJul 30, 2024 · 4 min read

Understanding Binary Search, DFS, BFS, and Sliding Window with Sample Code in Java

Let's explore these fundamental algorithms and techniques using Java. 1. Binary Search Binary Search is an efficient algorithm for finding an item from a sorted list of items. It works by repeatedly dividing in half the portion of the list that could...

0

PMPriya Mannurrookiecoderblogs.hashnode.devJul 19, 2024 · 2 min read

Breadth First Search

Breadth first search is used in graph algorithms for traversing through graph. It can be used to sort the graph, find cycles, solve mazes and sudokus. In this algorithm we traverse the neighbours of the nodes first and mark them down. We go on like t...

0

#breadth-fist-search

Search Hashnode