---
title: "#graph-traversal articles | Hashnode"
description: "Explore 9 articles tagged #graph-traversal on Hashnode. Tutorials, guides, and how-tos from the community."
url: "https://hashnode.com/tag/graph-traversal"
---

Tag

# #graph-traversal

9 posts · 0 followers

[Chetan Datta](https://hashnode.com/@chetan77) · [Aug 3, 2025](https://hashnode.com/posts/bfs-and-dfs-of-graph-traversal/688faad4a560602db4724828)

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

4 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/bfs-and-dfs-of-graph-traversal?utm_source=hashnode&utm_medium=feed)

[Chetan Datta](https://hashnode.com/@chetan77) · [Aug 3, 2025](https://hashnode.com/posts/connected-components-in-graph/688faad1f7c5a4fb43268608)

### [Connected Components in Graph](https://chetan77.hashnode.dev/connected-components-in-graph?utm_source=hashnode&utm_medium=feed)

Problem Given an undirected graph with V vertices numbered from 0 to V-1 and E edges, represented as a 2D array edges\[\]\[\], where each entry edges\[i\] = \[u, v\] denotes an edge between vertices u and v. Your task is to return a list of all connected com...

2 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/connected-components-in-graph?utm_source=hashnode&utm_medium=feed)

[Chetan Datta](https://hashnode.com/@chetan77) · [Aug 3, 2025](https://hashnode.com/posts/rotting-oranges/688faaae9a2092f09833237b)

### [Rotting Oranges](https://chetan77.hashnode.dev/rotting-oranges?utm_source=hashnode&utm_medium=feed)

Problem You are given an m x n grid where each cell can have one of three values: (link) 0 representing an empty cell, 1 representing a fresh orange, or 2 representing a rotten orange. Every minute, any fresh orange that is 4-directionally adjac...

4 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/rotting-oranges?utm_source=hashnode&utm_medium=feed)

[Kshitij Sharma](https://hashnode.com/@kshitijcodes) · [May 22, 2025](https://hashnode.com/posts/graph-traversal-made-simple-your-first-guide-to-bfs-and-dfs-code-for-new-developers/682f1a65ade7c315c4b164d5)

### [Graph Traversal Made Simple: Your First Guide to BFS & DFS Code (For New Developers)](https://kshitijcodes.hashnode.dev/graph-traversal-made-simple-your-first-guide-to-bfs-and-dfs-code-for-new-developers?utm_source=hashnode&utm_medium=feed)

We all have seen the graphical representations of BFS and DFS Traversals in YouTube videos. But what's hard is translating it into code.

8 min read · [kshitijcodes.hashnode.dev](https://kshitijcodes.hashnode.dev/graph-traversal-made-simple-your-first-guide-to-bfs-and-dfs-code-for-new-developers?utm_source=hashnode&utm_medium=feed)

[Saumyaa Garg](https://hashnode.com/@saumyaagarg) · [Dec 20, 2024](https://hashnode.com/posts/day-24-graph-traversals/676ccf8d1f2747160281815c)

### [Day 24: Graph Traversals](https://saumyaagarg.hashnode.dev/day-24-graph-traversals?utm_source=hashnode&utm_medium=feed)

Welcome to Day 24 of the 100 Days of DSA challenge! Graph traversal methods such as BFS and DFS are fundamental for exploring and analyzing graph structures. Today's focus was on leveraging these techniques to solve practical problems, including shor...

10 min read · [saumyaagarg.hashnode.dev](https://saumyaagarg.hashnode.dev/day-24-graph-traversals?utm_source=hashnode&utm_medium=feed)

[Pawan Gangwani](https://hashnode.com/@pgangwani) · [Nov 11, 2024](https://hashnode.com/posts/crafting-graphs-in-typescript-a-comprehensive-guide-to-building-and-traversing-data-structures/67350ddd049e22009ef2e70e)

### [Crafting Graphs in TypeScript: A Comprehensive Guide to Building and Traversing Data Structures](https://blogs.pgangwani.co.in/crafting-graphs-in-typescript-a-comprehensive-guide-to-building-and-traversing-data-structures?utm_source=hashnode&utm_medium=feed)

Learn how to build and traverse graph data structures using TypeScript, including vertices, edges, DFS, and BFS methods in this comprehensive guide

5 min read · [blogs.pgangwani.co.in](https://blogs.pgangwani.co.in/crafting-graphs-in-typescript-a-comprehensive-guide-to-building-and-traversing-data-structures?utm_source=hashnode&utm_medium=feed)

[SANTOSH SINGH](https://hashnode.com/@sansi28) · [May 31, 2024](https://hashnode.com/posts/exploring-depth-first-search-dfs-and-breadth-first-search-bfs-algorithms-with-java/669810be0c4c00780cc655c2)

### [Exploring Depth-First Search (DFS) and Breadth-First Search (BFS) Algorithms with JAVA](https://santoshsingh.hashnode.dev/exploring-depth-first-search-dfs-and-breadth-first-search-bfs-algorithms-with-java?utm_source=hashnode&utm_medium=feed)

Explore DFS and BFS algorithms for tree and graph traversal, implementations, characteristics, and applications

4 min read · [santoshsingh.hashnode.dev](https://santoshsingh.hashnode.dev/exploring-depth-first-search-dfs-and-breadth-first-search-bfs-algorithms-with-java?utm_source=hashnode&utm_medium=feed)

[Aayush Deshpande](https://hashnode.com/@AayushDeshpande) · [Jul 14, 2023](https://hashnode.com/posts/the-fundamental-graph-traversal-algorithms-breadth-first-search-and-depth-first-search/64b0abc911d44f78954325c9)

### [The Fundamental Graph Traversal Algorithms: Breadth-First-Search and Depth-First-Search](https://aayush-deshpande.hashnode.dev/the-fundamental-graph-traversal-algorithms-breadth-first-search-and-depth-first-search?utm_source=hashnode&utm_medium=feed)

Introduction to Graphs Binary trees are a type of data structure used widely in data science and other programming fields, as they allow for efficient data storage in a hierarchical method. This type of data structure represents an acyclic graph with...

5 min read · [aayush-deshpande.hashnode.dev](https://aayush-deshpande.hashnode.dev/the-fundamental-graph-traversal-algorithms-breadth-first-search-and-depth-first-search?utm_source=hashnode&utm_medium=feed)

[Poonam](https://hashnode.com/@Team-Optimizers) · [Dec 30, 2022](https://hashnode.com/posts/graph-traversal/63aec336359f463d43abe39b)

### [Graph Traversal](https://teamoptimizers.hashnode.dev/graph-traversal?utm_source=hashnode&utm_medium=feed)

A travel to Graph DataStructure!

10 min read · [teamoptimizers.hashnode.dev](https://teamoptimizers.hashnode.dev/graph-traversal?utm_source=hashnode&utm_medium=feed)

[2](https://hashnode.com/posts/graph-traversal/63aec336359f463d43abe39b)
