<｜begin▁of▁sentence｜>### Instruction:
Given a graph represented by edges [(0, 1), (1, 2), (1, 3), (3, 4), (1, 4)], how can you calculate and display all the simple paths from vertex 0 to every other reachable vertex?
### Response:
from igraph import Graph

# Create a simple graph
g = Graph([(0, 1), (1, 2), (1, 3), (3, 4), (1, 4)])

# Calculate all simple paths from vertex 0 to all other vertices
g_all_paths = g.get_all_simple_paths(0, to=None, cutoff=-1, mode='ALL')

# Print the paths
for path in g_all_paths:
    print(path)
<|EOT|>
