<｜begin▁of▁sentence｜>### Instruction:
As a Robotics Technician, you're tasked with ensuring the smooth operation of robotic systems in manufacturing or industrial environments. Imagine you're overseeing a production line where robots move along a network of paths to perform various tasks. 

Your supervisor hands you a file called "graph_example.gml," which contains the layout of these paths represented as a directed graph. They need you to simulate a scenario where a robot stationed at vertex 0 needs to traverse the network for 10 steps, moving only along outbound edges. Importantly, the simulation should ensure that the robot can return even if it encounters dead ends.

Your task is to program a routine to perform this simulation, and at the end, display the sequence of vertices visited by the robot during its 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|>
