---
title: "Discussion on \"12.Breadth-First Search (BFS)\" | Hashnode"
description: "Discussion on \"12.Breadth-First Search (BFS)\". BFS uses a Queue to keep track of which nodes to explore next.\nDefinition\nBFS explores all nodes level by level starting from the root.It visits all nodes at depth 1, then depth 2, and so on.\n Algorit"
url: "https://hashnode.com/posts/12-breadth-first-search-bfs/699aca2d09bbd76ce2cd722b"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [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

Feb 22 · 4 min read · ai-for-multidisciplinary-application.hashnode.dev  
Read the article

-   [#ai](https://hashnode.com/tag/ai)
-   [#artificial-intelligence](https://hashnode.com/tag/artificial-intelligence)
-   [#machine-learning](https://hashnode.com/tag/machine-learning)
-   [#ml](https://hashnode.com/tag/ml)
-   [#data-science](https://hashnode.com/tag/data-science)
-   [#computer-science](https://hashnode.com/tag/computer-science)
-   [#search](https://hashnode.com/tag/search)
-   [#searching-algorithms](https://hashnode.com/tag/searching-algorithms)
-   [#bfs](https://hashnode.com/tag/bfs)

## Written by

[Pranoti Patil](https://hashnode.com/@vibesAI)

@vibesAI

  
[View profile](https://hashnode.com/@vibesAI)

Simple notes for computer science students

## Responses

Markdown supported · ⌘↵ to post

No responses yet.