| 101 | } |
| 102 | |
| 103 | void dijkstra_update(struct dijkstra *dijkstra, u32 node_idx, s64 distance) |
| 104 | { |
| 105 | assert(node_idx < dijkstra_maxsize(dijkstra)); |
| 106 | |
| 107 | if(!dijkstra->heapptr[node_idx]) |
| 108 | { |
| 109 | // not in the heap |
| 110 | dijkstra_append(dijkstra, node_idx,distance); |
| 111 | global_dijkstra = dijkstra; |
| 112 | gheap_restore_heap_after_item_increase( |
| 113 | &dijkstra->gheap_ctx, |
| 114 | dijkstra->base, |
| 115 | dijkstra->heapsize, |
| 116 | dijkstra->heapptr[node_idx] |
| 117 | - dijkstra->base); |
| 118 | global_dijkstra = NULL; |
| 119 | return; |
| 120 | } |
| 121 | |
| 122 | if(dijkstra->distance[node_idx] > distance) |
| 123 | { |
| 124 | // distance decrease |
| 125 | dijkstra->distance[node_idx] = distance; |
| 126 | |
| 127 | global_dijkstra = dijkstra; |
| 128 | gheap_restore_heap_after_item_increase( |
| 129 | &dijkstra->gheap_ctx, |
| 130 | dijkstra->base, |
| 131 | dijkstra->heapsize, |
| 132 | dijkstra->heapptr[node_idx] |
| 133 | - dijkstra->base); |
| 134 | global_dijkstra = NULL; |
| 135 | }else |
| 136 | { |
| 137 | // distance increase |
| 138 | dijkstra->distance[node_idx] = distance; |
| 139 | |
| 140 | global_dijkstra = dijkstra; |
| 141 | gheap_restore_heap_after_item_decrease( |
| 142 | &dijkstra->gheap_ctx, |
| 143 | dijkstra->base, |
| 144 | dijkstra->heapsize, |
| 145 | dijkstra->heapptr[node_idx] |
| 146 | - dijkstra->base); |
| 147 | global_dijkstra = NULL; |
| 148 | |
| 149 | } |
| 150 | // assert(gheap_is_heap(&dijkstra->gheap_ctx, |
| 151 | // dijkstra->base, |
| 152 | // dijkstra_size())); |
| 153 | } |
| 154 | |
| 155 | u32 dijkstra_top(const struct dijkstra *dijkstra) |
| 156 | { |