<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edges [(0, 1), (0, 2), (1, 3), (1, 4), (2, 5), (2, 6)], how can you use igraph's 'dfsiter' to iterate through the graph in a DFS manner starting from the root vertex 0, including the distance from the root and the parent of each vertex?
### Response:
import igraph as ig

# Create a graph
edges = [(0, 1), (0, 2), (1, 3), (1, 4), (2, 5), (2, 6)]
g = ig.Graph(edges=edges, directed=True)

# Construct a DFS iterator starting at vertex 0
root_vertex_id = 0
mode = 'out'
advanced = True  # To get the distance and parent as well

# Create DFS iterator
dfs_iter = g.dfsiter(vid=root_vertex_id, mode=mode, advanced=advanced)

# Iterate through the graph
for dist, parent, vertex in dfs_iter:
    print(f'Vertex: {vertex}, Distance from root: {dist}, Parent: {parent}')
<|EOT|>
