This paper studies algorithms for computing a Gomory-Hu tree, which is a classical data structure that compactly stores all minimum $s$-$t$ cuts of an undirected weighted graph. We consider two classes of algorithms: the original method by Gomory and Hu and the method based on "OrderedCuts" that we recently proposed. We describe practical implementations of these methods, and compare them experimentally with the algorithms from the previous experimental studies by Goldberg and Tsioutsiouliklis (2001) and by Akibo et al. (2016) (designed for unweighted simple graphs). Results indicate that the method based on OrderedCuts is the most robust, and often outperforms other implementations by a large factor.

翻译：本文研究用于计算Gomory-Hu树的算法，该树是一种经典数据结构，能够紧凑地存储无向加权图中所有最小$s$-$t$割。我们考虑两类算法：Gomory和Hu提出的原始方法，以及我们近期提出的基于"OrderedCuts"的方法。我们描述了这些方法的实际实现，并通过实验将其与Goldberg和Tsioutsiouliklis（2001）以及Akibo等人（2016）先前实验研究中的算法（针对无权简单图设计）进行比较。结果表明，基于OrderedCuts的方法具有最强的鲁棒性，且通常以较大优势优于其他实现。