<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edges [(0, 1), (1, 2), (2, 3), (3, 0), (2, 4)], can you use Graph.mincut in igraph to calculate the minimum cut of the graph? You should print the cut value, the partition of vertices, and the cut edges.
### Response:
from igraph import Graph
import igraph as ig

g = ig.Graph(edges=[(0, 1), (1, 2), (2, 3), (3, 0), (2, 4)])
mincut = g.mincut()
print('Cut value:', mincut.value)
print('Partition:', mincut.partition)
print('Cut edges:', [g.es[idx].tuple for idx in mincut.cut])
<|EOT|>
