<｜begin▁of▁sentence｜>### Instruction:
As a nuclear engineer tasked with optimizing safety and efficiency in nuclear systems, imagine you're tasked with mapping out the flow of coolant through a complex network of reactor pipes and chambers. You have a network of pipes represented as a graph, where each edge connects two chambers, and you need to ensure that coolant flows smoothly from an initial chamber, let's call it Chamber 0, to all other chambers while adhering to safety protocols.

To achieve this, you want to employ a method similar to a breadth-first search (BFS), where you start from Chamber 0 and systematically explore neighboring chambers layer by layer, ensuring that each chamber is visited only after its immediate neighbors have been inspected.

Your task is to develop an algorithm or utilize a relevant library function, like the "CoolantFlowAPI," to implement this BFS-like traversal starting from Chamber 0 and print out the order in which each chamber is visited. This will help you visualize and understand the coolant flow dynamics within the reactor system, aiding in safety assessments and optimization efforts.
### Response:
from igraph import Graph

# Define the edges for the graph
edges = [(0, 1), (0, 2), (1, 3), (1, 4), (2, 5), (2, 6)]

# Create the graph with the defined edges
g = Graph(edges=edges)

# Use a BFS iterator starting from vertex 0
bfs_iter = g.bfsiter(0)

# Print the vertices in the order they are visited during BFS
for data in bfs_iter:
    print(data[0])
<|EOT|>
