The negative-weight shortest-paths problem, meanwhile, only makes sense on directed graphs, in which every edge is a one-way street. (Otherwise, a single undirected negative edge would create a ...