Coding Quiz

In this coding quiz, you are tasked with writing a program that uses the Breadth-First Search (BFS) algorithm to begin at a specific node of a graph and visit all the nodes.

The user will provide an adjacency list representing the nodes in the graph and their connections. Write a program to perform BFS starting from a specific node and print the order in which all nodes are visited.

Copy
def solution(graph):
    # Write your code here
    return

---

• The graph is an undirected graph.

• All nodes are represented by numbers, starting from 1.

• The graph has at least one node and at most 100 nodes.

• There is at most one edge between any two nodes.

• The starting node is always node 1.

---

• Adjacency List: {1: [2, 3], 2: [4], 3: [4], 4: []}

• Starting Node: 1

• Order of Visits: [1, 2, 3, 4]