mirror of
https://github.com/lightningnetwork/lnd.git
synced 2025-02-22 14:22:37 +01:00
routing: cap number of yen's algorithm iterations at 100
This commit makes a precautionary change in order to ensure that the upper bound on the number of iteration’s within our version of Yen’s algorithm is fixed.
This commit is contained in:
parent
09521b9c2a
commit
5ef077e5c8
1 changed files with 3 additions and 1 deletions
|
@ -536,7 +536,7 @@ func findPaths(graph *channeldb.ChannelGraph, source *channeldb.LightningNode,
|
|||
|
||||
// While we still have candidate paths to explore we'll keep exploring
|
||||
// the sub-graphs created to find the next k-th shortest path.
|
||||
for k := 1; k == 1 || candidatePaths.Len() != 0; k++ {
|
||||
for k := 1; k < 100; k++ {
|
||||
prevShortest := shortestPaths[k-1]
|
||||
|
||||
// We'll examine each edge in the previous iteration's shortest
|
||||
|
@ -605,6 +605,8 @@ func findPaths(graph *channeldb.ChannelGraph, source *channeldb.LightningNode,
|
|||
newPath.hops = append(newPath.hops, rootPath...)
|
||||
newPath.hops = append(newPath.hops, spurPath...)
|
||||
|
||||
// TODO(roasbeef): add and consult path finger print
|
||||
|
||||
// We'll now add this newPath to the heap of candidate
|
||||
// shortest paths.
|
||||
heap.Push(&candidatePaths, newPath)
|
||||
|
|
Loading…
Add table
Reference in a new issue