<｜begin▁of▁sentence｜>### Instruction:
Given a random Erdős-Rényi graph with 10 vertices and a connection probability of 0.5, can you compute the shortest path lengths from vertex 0 to all other vertices using the 'shortest_paths' method in igraph?
### Response:
import igraph as ig

# Create an igraph graph
graph = ig.Graph.Erdos_Renyi(n=10, p=0.5)

# Compute the shortest paths from vertex 0 to all other vertices using deprecated alias
paths = graph.shortest_paths(0)

# Print the shortest path lengths
for i, path in enumerate(paths[0]):
    print(f'Shortest path length from vertex 0 to vertex {i}:', path)
<|EOT|>
