| 163 | } |
| 164 | |
| 165 | void dijkstra_pop(struct dijkstra *dijkstra) |
| 166 | { |
| 167 | if(dijkstra->heapsize==0) |
| 168 | return; |
| 169 | |
| 170 | const u32 top = dijkstra_top(dijkstra); |
| 171 | assert(dijkstra->heapptr[top]==dijkstra->base); |
| 172 | |
| 173 | global_dijkstra = dijkstra; |
| 174 | gheap_pop_heap( |
| 175 | &dijkstra->gheap_ctx, |
| 176 | dijkstra->base, |
| 177 | dijkstra->heapsize--); |
| 178 | global_dijkstra = NULL; |
| 179 | |
| 180 | dijkstra->heapptr[top]=NULL; |
| 181 | } |
| 182 | |
| 183 | const s64* dijkstra_distance_data(const struct dijkstra *dijkstra) |
| 184 | { |