[Codepath/BFS, Graph] Count Connected Components

def count_components(adjacency_dict):
    # Write your code here
    visited = set()
    cnt = 0
    
    def dfs(node):
        visited.add(node)
        for neighbor in adjacency_dict[node]:
            if neighbor not in visited:
                dfs(neighbor)
    
    for node in adjacency_dict:
        if node not in visited:
            dfs(node)
            cnt += 1
    
    return cnt