Create a BFS algorithm function based off the following tree in C++:

Use the following vector when creating the BFS algorithm function:

vector> edges {{0, 1}, {0, 2}, {0, 3}, {1, 4}, {1, 5}, {1, 6}, {4, 9}, {3, 7}, {3, 8}};

Return a vector of nodes, containing the nodes visited.