Before revision:  STOC'19]. In this paper, we provide an exact \tilde O(\sqrt n + D)-time algorithm for computing min-cut on weighted networks.
After revision:  STOC'19]. In this paper, we provide an exact \tilde O(\sqrt n + D)-time algorithm for computing min-cut on *weighted* networks.