Key points are not available for this paper at this time.
An assertion that Dijkstra's algorithm for shortest paths (adapted to allow arcs of negative weight) runs in O ( n 3 ) steps is disproved by showing a set of networks which take O ( n 2 n ) steps.
D. Barton Johnson (Sun,) studied this question.