<｜begin▁of▁sentence｜>### Instruction:
As a Solar Energy Technician, I help install, maintain, and repair solar energy systems for residential and commercial use. Today, a customer wants to optimize the wiring configuration for a solar panel network. The challenge is to determine all the most efficient paths from the main power source to each solar panel. With this edge-set data [(0, 1), (1, 2), (2, 3), (3, 4), (0, 4)], I need to use the get_all_shortest_paths function to calculate all the shortest paths from the main power source (vertex 0) to each solar panel (vertex 4). This will help ensure an efficient and reliable distribution of power within the solar panel network.
### Response:
from igraph import Graph

# Define your graph
edges = [(0, 1), (1, 2), (2, 3), (3, 4), (0, 4)]
g = Graph(edges)

# Calculate all shortest paths from vertex 0 to vertex 4
all_paths = g.get_all_shortest_paths(0, to=4)

# Print all shortest paths
for path in all_paths:
    print(path)
<|EOT|>
