<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edges [(0, 1), (0, 2), (1, 3), (1, 4), (2, 5)], can you create a depth first search iterator starting from vertex 0 and print the nodes as they are visited in DFS order?
### Response:
import igraph as ig

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

# Define the starting vertex for DFS
start_vertex = 0

# Create a depth first search (DFS) iterator
dfs_iterator = g.dfsiter(start_vertex)

# Iterate through nodes in DFS order and print them
for node in dfs_iterator:
    print(node.index)
<|EOT|>
