<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with nodes and directed edges, can you use the dfsiter function in igraph to perform a depth-first search (DFS) starting from node 1? Assume 'out' mode for traversal and advanced output with node levels and parent nodes.
### Response:
import igraph as ig

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

# Use dfsiter to create a DFS iterator from node 1
iterator = g.dfsiter(vid=1, mode='out', advanced=True)

# Iterate through the graph using the DFS iterator
for level, parent, vertex in iterator:
    print(f'Node: {vertex}, Level: {level}, Parent: {parent}')
<|EOT|>
