<｜begin▁of▁sentence｜>### Instruction:
As a school psychologist, you are helping a group of students understand and navigate a complex network of relationships. You've been given a map of the connections between students, represented as a graph with the edge set [(0, 1), (0, 2), (1, 3), (1, 4), (2, 5)]. The task is to teach the students about exploring this network using the breadth-first search strategy, starting from vertex 0. This will help them understand the importance of maintaining connections and exploring new connections in a systematic manner.
### Response:
import igraph as ig

# Create a graph with some edges
g = ig.Graph(edges=[(0, 1), (0, 2), (1, 3), (1,4), (2, 5)])

# Run BFS from vertex 0
bfs_iterator = g.bfsiter(0, mode='out')

# Print BFS order
for vertex in bfs_iterator:
    print(vertex)
<|EOT|>
