bfs2.py

def bfs(graph, start, goal):
    queue = []
    visited = []
    queue.append(start)
    visited.append(start)
    path = ""
    found = False
    
    while queue:
        m = queue.pop(0)
        path += m + " "
        if m == goal:
            found = True
            break
        for neighbour in graph.get(m, []):
            if neighbour not in visited:
                visited.append(neighbour)
                queue.append(neighbour)
    
    if found:
        print("Goal node found")
        print("Path:", path)
    else:
        print("Goal node not found")

n = int(input("Enter no. of nodes: "))
graph = {}

for i in range(n):
    key = input("Enter the parent node: ")
    value = input("Enter the child nodes (space-separated): ").split()
    graph[key] = value

start = input("Enter start node: ")
goal = input("Enter goal node: ")
bfs(graph, start, goal)