mirrors/lnd
1
0
Fork 0
mirror of https://github.com/lightningnetwork/lnd.git synced 2025-03-03 17:26:57 +01:00
Code Issues Projects Releases Wiki Activity

routing/pathfind: avoid retraversing nodes at infinity

Browse source
This commit is contained in:
Conner Fromknecht 2020-06-24 01:26:02 -07:00
parent 1de7e30cd1
commit aa03dffc58
No known key found for this signature in database
GPG key ID: E7D737B67FA592C7
1 changed files with 14 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

14
routing/pathfind.go
View file

@ -647,6 +647,20 @@ func findPath(g *graphParams, r *RestrictParams, cfg *PathFindingConfig,
int64(cfg.PaymentAttemptPenalty), int64(cfg.PaymentAttemptPenalty),
) )
// If a low probability causes us to treat the distance as
// infinite, forgo adding this node to the distance map. Not
// only does this convserve memeory, it also prevents a
// situation where we keep exploring those nodes that are at
// infinity, but whose probability improves slightly. This can
// happen when we compute this node has infinite distance, but
// _passes_ the checks below against a previously inserted node
// (also at infinity) with slightly worse probabilty. In that
// case, the node will be readded to the distance heap and cause
// us to retraverse the node.
if tempDist == infinity {
return
}
// If there is already a best route stored, compare this // If there is already a best route stored, compare this
// candidate route with the best route so far. // candidate route with the best route so far.
current, ok := distance[fromVertex] current, ok := distance[fromVertex]