<｜begin▁of▁sentence｜>### Instruction:
Given a graph with 5 vertices and the following undirected edges: [(0, 1), (0, 2), (1, 3), (3, 4)], how would you use igraph's dfsiter function to print all vertices in Depth First Search order starting from vertex 0?
### Response:
from igraph import Graph

# Create a simple graph with 5 vertices and a few edges
g = Graph(edges=[(0, 1), (0, 2), (1, 3), (3, 4)], directed=False)

# Create a DFS iterator starting from vertex 0
dfs_iterator = g.dfsiter(0)

# Use the iterator to print all vertices in DFS order
for vertex in dfs_iterator:
    print(vertex.index)
<|EOT|>
