Files
lnd/routing/heap.go
Olaoluwa Osuntokun 9f96ceb1e0 routing: introduce new heap for storing candidate shortest paths
This commit adds a new heap structure to heap.go which will be used for
storing candidate paths during the iterations of the k-shortest paths
algorithm.
2017-03-21 12:20:30 -07:00

3.6 KiB