<｜begin▁of▁sentence｜>### Instruction:
Given a graph with the edge set [(0, 1), (0, 2), (1, 3), (2, 3)], can you conduct a breadth first search (BFS) starting from vertex 0 and provide the following information: the visited vertices in the order they were visited, the start indices of the layers in the vertex list, and the parent of every vertex in the BFS tree?
### Response:
from igraph import Graph

# Create a graph
g = Graph(edges=[(0, 1), (0, 2), (1, 3), (2, 3)])

# Perform BFS from vertex 0
bfs_result = g.bfs(vid=0)

# Print the result of BFS
print('Visited vertices:', bfs_result[0])
print('Layer start indices:', bfs_result[1])
print('Parents in BFS tree:', bfs_result[2])
<|EOT|>
