<｜begin▁of▁sentence｜>### Instruction:
Using the GraphBase.dfsiter function in igraph, can you print the order of visited vertices in a DFS traversal starting from vertex 0 for a graph defined by the edges [(0, 1), (0, 2), (1, 3), (2, 3), (3, 4), (4, 5)]?
### Response:
from igraph import Graph

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

# Perform a DFS starting from vertex 0
for vertex in g.dfsiter(vid=0, mode='out', advanced=False):
    print('Visited vertex:', vertex)
<|EOT|>
