Rusty Russell 7caa37f0f1 gossipd: implement Dijkstra. ... Use a uintmap as our minheap. Note that Dijkstra can give overlength routes, so some checks are disabled. Comparison using gossipd/test/run-bench-find_route 100000 10: Before: 10 (10 succeeded) routes in 100000 nodes in 120087 msec (12008708402 nanoseconds per route) After: 10 (10 succeeded) routes in 100000 nodes in 2269 msec (226925462 nanoseconds per route) Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>		2019-04-18 06:33:09 +00:00
..
test	gossipd: implement Dijkstra.	2019-04-18 06:33:09 +00:00
broadcast.c	gossipd: fix the check for node announcement in broadcast_state_check()	2019-04-16 00:20:26 +00:00
broadcast.h	gossipd: adjust peers' broadcast_offset when compacting store.	2019-04-11 18:31:34 -07:00
gossip_constants.h	Use node_id everywhere for nodes.	2019-04-09 12:37:16 -07:00
gossip_peerd_wire.csv	Use node_id everywhere for nodes.	2019-04-09 12:37:16 -07:00
gossip_store.c	gossipd: adjust peers' broadcast_offset when compacting store.	2019-04-11 18:31:34 -07:00
gossip_store.csv	daemons: use amount_msat/amount_sat in all internal wire transfers.	2019-02-21 08:01:37 +00:00
gossip_store.h	gossipd: adjust peers' broadcast_offset when compacting store.	2019-04-11 18:31:34 -07:00
gossip_wire.csv	Use node_id everywhere for nodes.	2019-04-09 12:37:16 -07:00
gossipd.c	gossipd: adjust peers' broadcast_offset when compacting store.	2019-04-11 18:31:34 -07:00
Makefile	Use node_id everywhere for nodes.	2019-04-09 12:37:16 -07:00
routing.c	gossipd: implement Dijkstra.	2019-04-18 06:33:09 +00:00
routing.h	gossipd: implement Dijkstra.	2019-04-18 06:33:09 +00:00