Unfortunately, standard low-diameter decomposition algorithms only work on undirected graphs — those in which every edge can be traversed in both directions. The negative-weight shortest-paths problem ...