LeetCode 323: Number of Connected Components in an Undirected Graph

[github-actions]

LeetCode 323: Number of Connected Components in an Undirected Graph

Category: Graph
Difficulty: See LeetCode
Solution File: src/graph/number_of_connected_components_in_an_undirected_graph.py
Test File: tests/test_number_of_connected_components_in_an_undirected_graph.py

Problem Description

You have a graph of n nodes. You are given an integer n and an array edges where edges[i] = [ai, bi]
indicates that there is an edge between ai and bi in the graph.

Return the number of connected components in the graph.

Example 1:
Input: n = 5, edges = [[0,1],[1,2],[3,4]]
Output: 2

Example 2:
Input: n = 5, edges = [[0,1],[1,2],[2,3],[3,4]]
Output: 1

Constraints:

• 1 <= n <= 2000
• 0 <= edges.length <= 5000
• edges[i].length == 2

Tasks

• Implement the solution in src/graph/number_of_connected_components_in_an_undirected_graph.py
• Ensure all test cases pass
• Analyze time complexity
• Analyze space complexity