Create a DFS algorithm based off the following graph in Python:

Use the following 2D list when creating the function:

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