---
title: "Discussion on \"Connected Components in Graph\" | Hashnode"
description: "Discussion on \"Connected Components in Graph\". Problem\nGiven 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.\nYour task is to return a list of all connected com..."
url: "https://hashnode.com/posts/connected-components-in-graph/688faad1f7c5a4fb43268608"
---

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

Discussion

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

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

-   [#connected-components-in-graph](https://hashnode.com/tag/connected-components-in-graph)
-   [#graphs](https://hashnode.com/tag/graphs)
-   [#dsa](https://hashnode.com/tag/dsa)
-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#graph-traversal](https://hashnode.com/tag/graph-traversal)

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