Aim: Write a Program to Implement Depth First Search using Python

Program:

# Using a Python dictionary to act as an adjacency list
graph = {
    'A': ['B', 'C'],
    'B': ['D', 'E'],
    'C': ['F'],
    'D': [],
    'E': ['F'],
    'F': []
}

visited = set() 

def dfs(visited, graph, node):
    if node not in visited:
        print(node)  
        visited.add(node) 
        for neighbour in graph[node]:  
            dfs(visited, graph, neighbour)  

# Driver Code
dfs(visited, graph, 'A')