a4e26eaa4a
This commit fixes a bug within the k-shortest paths routine which could result in a daemon panic when traversing a graph with particular characteristics. Before referencing the path to create a sub-slice, we we’re properly asserting that the length of the path was at least as long as the current rootPath in question. We fix this by simply ensuring the length of the slice is adequate before proceeding with the operation. |
||
|---|---|---|
| .. | ||
| testdata | ||
| errors.go | ||
| graph.go | ||
| heap_test.go | ||
| heap.go | ||
| log.go | ||
| notifications_test.go | ||
| notifications.go | ||
| pathfind_test.go | ||
| pathfind.go | ||
| README.md | ||
| router_test.go | ||
| router.go | ||
routing
The routing package implements authentication+validation of channel announcements, pruning of the channel graph, path finding within the network, sending outgoing payments into the network and synchronizing new peers to our channel graph state.
Installation and Updating
$ go get -u github.com/lightningnetwork/lnd/routing