678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455

from collections import deque

class Solution:
    # Function to count connected components in an undirected graph
    def countComponents(self, V, edges):
        
        # Create adjacency list from edge list
        adj = [[] for _ in range(V)]
        for u, v in edges:
            adj[u].append(v)
            adj[v].append(u)

        # List to keep track of visited nodes
        visited = [False] * V

        # Variable to count the number of connected components
        components = 0

        # Traverse all nodes in the graph
        for i in range(V):

            # If the node is not visited, it's a new component
            if not visited[i]:
                components += 1

                # Start BFS from this node
                q = deque()
                q.append(i)
                visited[i] = True

                # Perform BFS traversal
                while q:
                    node = q.popleft()

                    # Visit all unvisited neighbors
                    for nbr in adj[node]:
                        if not visited[nbr]:
                            visited[nbr] = True
                            q.append(nbr)

        # Return the total number of connected components
        return components

# Number of vertices
V = 5

# List of undirected edges
edges = [[0, 1], [1, 2], [3, 4]]

# Create solution object
sol = Solution()

# Print the number of connected components
print("Number of Connected Components:", sol.countComponents(V, edges))

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061

class Solution {
    // Function to count connected components in an undirected graph
    countComponents(V, edges) {

        // Create adjacency list from edge list
        const adj = Array.from({ length: V }, () => []);
        for (const [u, v] of edges) {
            adj[u].push(v);
            adj[v].push(u);
        }

        // Array to keep track of visited nodes
        const visited = new Array(V).fill(false);

        // Variable to count the number of connected components
        let components = 0;

        // Traverse all nodes in the graph
        for (let i = 0; i < V; i++) {

            // If the node is not visited, it's a new component