<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edges [(0, 1), (0, 2), (1, 3), (3, 4), (4, 5)], can you use the bfs function in igraph to perform a breadth-first search starting from vertex 0, and print the order of visited vertices, the start indices of layers, and the parent of every vertex in the BFS?
### Response:
from igraph import Graph

# Create an example graph
edges = [(0, 1), (0, 2), (1, 3), (3, 4), (4, 5)]
g = Graph(edges)

# Conducting BFS on the graph starting from vertex 0
bfs_result = g.bfs(vid=0, mode='out')

# Unpacking the result
visited_vertices, layers_start, parents = bfs_result

# Displaying the results
print('Visited vertices:', visited_vertices)
print('Layer starts:', layers_start)
print('Parents:', parents)
<|EOT|>
