Find shortest path in unbalanced graph

shortest_path.py

from queue import Queue 

def shortest_path(graph, start_node, end_node):
    visited = set()
    q = Queue()
    # (current_node, path)
    q.put((start_node,[start_node]))
    while q.qsize():
        curr_node, path = q.get()
        print(curr_node, path)
        
        if curr_node == end_node:
            return path
        
        if curr_node not in visited:
        	visited.add(curr_node)
        	
        	for next_node in graph[curr_node]:
        		q.put((next_node,path + [next_node])) 


# Example graph as an adjacency list
graph = {
    'A': ['B'],
    'B': ['A', 'C', 'E'],
    'C': ['B', 'F'],
    'D': ['A'],
    'E': ['B', 'F'],
    'F': ['C', 'E']
}

# Print the entire graph
print("Graph:")

start_node = 'A'
end_node = 'F'
result_path = shortest_path(graph, start_node, end_node)

print(f"\nShortest path from {start_node} to {end_node}: {result_path}")