araspitzu fd3ff9184e Compute routes backward (#797) ... * Support searching backward from the target * Use the amount+fees with testing for min/max htlc value of edges * Build the adjacency list graph with incoming edges instead of outgoing * Make sure we don't find routes longer than the max allowed by the spec * Remove default amount msat, enhance 'findroute' API * Optimize tests for ignored edges in Dijkstra * Enhance test for max route length, fix the length to 20 channels * Add test for routing to a target that is not in the graph (assisted routes)		2019-01-11 17:20:01 +01:00
..
src	Compute routes backward (#797)	2019-01-11 17:20:01 +01:00
eclair-cli	Updated readme.md and eclair-cli (#750)	2018-11-13 17:35:16 +01:00
pom.xml	Fix short_channel_id parsing and add RPC API test (#815)	2019-01-11 14:59:33 +01:00