DFS for Connected Components

MediumPython

Problem

Implement a Graph Depth-First Search (DFS) traversal to discover connected components or solve path-finding problems under specific constraints. For this version, count connected components in an undirected graph represented by n vertices and an edge list. Return the number of components, including isolated vertices.

Function: def count_components(n, edges):

Input: n is an integer and edges is a list of two-element vertex pairs. Output: an integer count.

Constraints

0 <= n <= 1000
0 <= edges.length <= 5000
Each edge contains exactly two distinct integers
0 <= edges[i][0], edges[i][1] < n
The graph is undirected
There are no duplicate edges

Function Signature

def count_components(n, edges):

CodePython 3

You need to log in / sign up to run or submit.Ln 2

Run your code to see test output here.