Create a DFS algorithm based off the following graph in C++:

Use the following 2D vector when creating the function:

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

Return a list of nodes, containing the nodes visited.

START