equal
deleted
inserted
replaced
184 Node v=heap.top(); |
184 Node v=heap.top(); |
185 ValueType oldvalue=heap[v]; |
185 ValueType oldvalue=heap[v]; |
186 heap.pop(); |
186 heap.pop(); |
187 distance.set(v, oldvalue); |
187 distance.set(v, oldvalue); |
188 |
188 |
189 for(OutEdgeIt e = G.template first<OutEdgeIt>(v); |
189 { //FIXME this bracket is for e to be local |
|
190 OutEdgeIt e; |
|
191 for(G.first(e, v); |
190 G.valid(e); G.next(e)) { |
192 G.valid(e); G.next(e)) { |
191 Node w=G.head(e); |
193 Node w=G.head(e); |
192 |
194 |
193 switch(heap.state(w)) { |
195 switch(heap.state(w)) { |
194 case heap.PRE_HEAP: |
196 case heap.PRE_HEAP: |
205 break; |
207 break; |
206 case heap.POST_HEAP: |
208 case heap.POST_HEAP: |
207 break; |
209 break; |
208 } |
210 } |
209 } |
211 } |
|
212 } //FIXME tis bracket |
210 } |
213 } |
211 } |
214 } |
212 |
215 |
213 } //END OF NAMESPACE HUGO |
216 } //END OF NAMESPACE HUGO |
214 |
217 |