equal
deleted
inserted
replaced
91 "Error in a shortest path tree edge!"); |
91 "Error in a shortest path tree edge!"); |
92 } |
92 } |
93 } |
93 } |
94 |
94 |
95 for(NodeIt v(graph); v!=INVALID; ++v) { |
95 for(NodeIt v(graph); v!=INVALID; ++v) { |
96 if ( dijkstra.reached(v) && dijkstra.pred(v) != INVALID ) { |
96 if ( dijkstra.reached(v) && dijkstra.predEdge(v) != INVALID ) { |
97 Edge e=dijkstra.pred(v); |
97 Edge e=dijkstra.predEdge(v); |
98 Node u=graph.source(e); |
98 Node u=graph.source(e); |
99 check( dijkstra.dist(v) - dijkstra .dist(u) == length[e], |
99 check( dijkstra.dist(v) - dijkstra .dist(u) == length[e], |
100 "Error in a shortest path tree edge!"); |
100 "Error in a shortest path tree edge!"); |
101 } |
101 } |
102 } |
102 } |