<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with edges [(0, 1), (1, 2), (2, 0)] and capacities [8, 10, 5], can you use the gomory_hu_tree function in igraph to calculate and print the minimum cut value for each edge of the Gomory-Hu tree?
### Response:
import igraph as ig

# Create an undirected graph with edge capacities
g = ig.Graph([(0, 1), (1, 2), (2, 0)], directed=False)
g.es['capacity'] = [8, 10, 5]

# Calculate the Gomory-Hu tree of the graph
gomory_hu_tree = g.gomory_hu_tree()

# Print the Gomory-Hu tree edges and the corresponding minimum cut value
for edge in gomory_hu_tree.es:
    print(f'Edge: {edge.source}-{edge.target}, min cut value: {edge['flow']}')
<|EOT|>
