| 591 | } |
| 592 | |
| 593 | static void inline _add_path |
| 594 | ( |
| 595 | heap_t **heap, |
| 596 | WeightedPath *p |
| 597 | ) { |
| 598 | WeightedPath *pp = rm_malloc(sizeof(WeightedPath)); |
| 599 | pp->path = Path_Clone(p->path); |
| 600 | pp->weight = p->weight; |
| 601 | pp->cost = p->cost; |
| 602 | Heap_offer(heap, pp); |
| 603 | } |
| 604 | |
| 605 | // find k minimal weighted path (path can have different weight) |
| 606 | static void SPpaths_k_minimal |
no test coverage detected