one of the schemes employed by existing directed MST parsers) and then transform these directed weights into undirected ones.
given two vertices u and v with directed edges (u, v) and (v, u), weighted with , u) respectively, the goal is to compute the weight s u (û , v) of the undirected edge (û , v) connecting them in the undirected graph.