| 68 | |
| 69 | |
| 70 | void dijkstra_init(struct dijkstra *dijkstra) |
| 71 | { |
| 72 | const size_t max_num_nodes = tal_count(dijkstra->distance); |
| 73 | dijkstra->heapsize=0; |
| 74 | for(size_t i=0;i<max_num_nodes;++i) |
| 75 | { |
| 76 | dijkstra->distance[i]=INFINITE; |
| 77 | dijkstra->heapptr[i] = NULL; |
| 78 | } |
| 79 | } |
| 80 | size_t dijkstra_size(const struct dijkstra *dijkstra) |
| 81 | { |
| 82 | return dijkstra->heapsize; |