---
title: "Discussion on \"Breadth First Search\" | Hashnode"
description: "Discussion on \"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..."
url: "https://hashnode.com/posts/breadth-first-search/669aec8d57d9d1d8f687f8f7"
---

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

Discussion

# [Breadth First Search](https://rookiecoderblogs.hashnode.dev/breadth-first-search?utm_source=hashnode&utm_medium=feed)

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

Jul 19, 2024 · 2 min read · rookiecoderblogs.hashnode.dev  
Read the article

-   [#bfs](https://hashnode.com/tag/bfs)
-   [#breadth-fist-search](https://hashnode.com/tag/breadth-fist-search)

## Written by

[Priya Mannur](https://hashnode.com/@priyamannur)

@priyamannur

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

Software developer

Exploring..

## Responses

Markdown supported · ⌘↵ to post

No responses yet.