Rusty Russell 9f0c0e1cca askrene: use a simple array as our queue. ... We only ever visit each node once, so we can just use an array. This avoids calling tal() all the time, which is *especially* slow when we're memory tracking. I had an old canned gossmap which I benchmarked for these (and in particular one node was unreachable, and that was slow): Before: 17.27 seconds After: 5.80 seconds Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>		2024-10-04 08:47:53 +09:30
..
askrene.c	askrene: move flow refining code to its own file.	2024-09-19 12:16:53 +09:30
askrene.h	askrene: move flow refining code to its own file.	2024-09-19 12:16:53 +09:30
dijkstra.c	askrene: copy flow and dijkstra from renepay.	2024-08-07 20:35:30 +09:30
dijkstra.h	askrene: copy flow and dijkstra from renepay.	2024-08-07 20:35:30 +09:30
flow.c	askrene: add a "refining" step to add fees and handle corner cases.	2024-09-19 12:16:53 +09:30
flow.h	askrene: add a "refining" step to add fees and handle corner cases.	2024-09-19 12:16:53 +09:30
layer.c	askrene: add "auto.localchans" layer.	2024-08-07 20:35:30 +09:30
layer.h	askrene: add "auto.localchans" layer.	2024-08-07 20:35:30 +09:30
Makefile	askrene: move flow refining code to its own file.	2024-09-19 12:16:53 +09:30
mcf.c	askrene: use a simple array as our queue.	2024-10-04 08:47:53 +09:30
mcf.h	askrene: include the mcf and flow routines.	2024-08-07 20:35:30 +09:30
refine.c	askrene: re-check min_htlc violations after correcting for MCF rounding.	2024-09-19 12:16:53 +09:30
refine.h	askrene: move flow refining code to its own file.	2024-09-19 12:16:53 +09:30
reserve.c	common/amount: add amount_msat_accumulate()	2024-09-19 12:16:53 +09:30
reserve.h	askrene: memleak: scan reserved htable	2024-08-13 09:12:40 +09:30