<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph which you can read from graph_example.gml, can you perform a random walk of length 10 starting from vertex 0, following only outbound edges, and ensuring that the walk can return even if it gets stuck? Afterward, print the list of vertices visited during the walk.
### Response:
from igraph import Graph

# Create an example graph
g = ig.read('graph_example.gml')

# Perform a random walk of length 10 starting from vertex 0
walk = g.random_walk(start=0, steps=10, mode='out', stuck='return')

# Print the vertices visited during the walk
print(walk)
<|EOT|>
