---
title: "Discussion on \"BFS over DFS in graphs\" | Hashnode"
description: "Discussion on \"BFS over DFS in graphs\". BFS\nThe main funda of BFS is to traverse the entire graph in less time than DFS, BFS traversing helps us to travel multiple nodes at the same time from the same start node. so we use the BFS algorithm to reach the target node in less time.\nWhereas DF..."
url: "https://hashnode.com/posts/bfs-over-dfs-in-graphs/63cc25823803d2ef740e0172"
---

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

Discussion

# [BFS over DFS in graphs](https://graphs.hashnode.dev/bfs-over-dfs-in-graphs?utm_source=hashnode&utm_medium=feed)

BFS The main funda of BFS is to traverse the entire graph in less time than DFS, BFS traversing helps us to travel multiple nodes at the same time from the same start node. so we use the BFS algorithm to reach the target node in less time. Whereas DF...

Jan 21, 2023 · 1 min read · graphs.hashnode.dev  
Read the article

-   [#graphsincp](https://hashnode.com/tag/graphsincp)

## Written by

[akhil](https://hashnode.com/@Akhil06)

@Akhil06

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

I am a web developer who fascinates to learn new things.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.