---
title: "Discussion on \"BFS and DFS of Graph traversal\" | Hashnode"
description: "Discussion on \"BFS and DFS of Graph traversal\". BFS\nGiven a connected undirected graph containing V vertices, represented by a 2-d adjacency list adj[][], where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0,..."
url: "https://hashnode.com/posts/bfs-and-dfs-of-graph-traversal/688faad4a560602db4724828"
---

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

Discussion

# [BFS and DFS of Graph traversal](https://chetan77.hashnode.dev/bfs-and-dfs-of-graph-traversal?utm_source=hashnode&utm_medium=feed)

BFS Given a connected undirected graph containing V vertices, represented by a 2-d adjacency list adj\[\]\[\], where each adj\[i\] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0,...

Aug 3, 2025 · 4 min read · chetan77.hashnode.dev  
Read the article

-   [#bfs](https://hashnode.com/tag/bfs)
-   [#dfs](https://hashnode.com/tag/dfs)
-   [#graphs](https://hashnode.com/tag/graphs)
-   [#graph-traversal](https://hashnode.com/tag/graph-traversal)
-   [#traversal](https://hashnode.com/tag/traversal)
-   [#dsa](https://hashnode.com/tag/dsa)

## Written by

[Chetan Datta](https://hashnode.com/@chetan77)

@chetan77 · Hyderabad, India

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

Software Engineer

I share my learnings here. Thanks for reading.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
