<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph which you can read from 'network.gml', can you calculate and print the Gomory-Hu tree to understand the maximum flow or minimum cut between all pairs of vertices?
### Response:
import igraph as ig

# Read the graph
G = ig.Graph.Read_GML('network.gml')

# Calculate the Gomory-Hu tree
gh_tree = G.gomory_hu_tree()

# Print the Gomory-Hu tree
print(gh_tree)
<|EOT|>
