A Gomory–Hu tree is a data structure that represents the minimum cuts of a weighted undirected graph. It is named after mathematicians Ralph Gomory and Thomas Hu, who introduced the concept in the early 1960s. The Gomory–Hu tree provides a compact representation of all maximum flow and minimum cut pairs in the graph. ### Key Features: 1. **Structure**: The Gomory–Hu tree is a binary tree.
New to topics? Read the docs here!