<｜begin▁of▁sentence｜>### Instruction:
As a preschool teacher, imagine that you're arranging a fun educational activity for your students. You could create a pretend town for them to explore, with streets and buildings representing different destinations. You would label the vertices as 'A', 'B', 'C', and 'D', each representing a different location. The edges connecting the vertices would indicate the paths between locations. With this setup, you could use the shortest_paths method in igraph to find the shortest paths for the children to travel from location 'A' to 'D'. This activity would help them to learn about navigation and the concept of shortest paths in a playful and engaging way.
### Response:
from igraph import Graph
import igraph as ig

# Create a graph
edges = [(0,1), (1,2), (2,3), (3,0), (0,2)]
vertex_labels = ['A', 'B', 'C', 'D']
g = Graph(edges)
g.vs['label'] = vertex_labels

# Using the shortest_paths (deprecated, use distances) function
shortest_paths_result = g.shortest_paths(source=0, target=3)
print(shortest_paths_result)
<|EOT|>
