@@ -697,7 +697,6 @@ func findPath(g *graphParams, r *RestrictParams, cfg *PathFindingConfig,
697697 // processEdge is a helper closure that will be used to make sure edges
698698 // satisfy our specific requirements.
699699 processEdge := func (fromVertex route.Vertex ,
700- fromFeatures * lnwire.FeatureVector ,
701700 edge * unifiedEdge , toNodeDist * nodeWithDist ) {
702701
703702 edgesExpanded ++
@@ -783,6 +782,17 @@ func findPath(g *graphParams, r *RestrictParams, cfg *PathFindingConfig,
783782 // Check if accumulated fees would exceed fee limit when this
784783 // node would be added to the path.
785784 totalFee := int64 (netAmountToReceive ) - int64 (amt )
785+
786+ log .Trace (lnutils .NewLogClosure (func () string {
787+ return fmt .Sprintf (
788+ "Checking fromVertex (%v) with " +
789+ "minInboundFee=%v, inboundFee=%v, " +
790+ "amountToSend=%v, amt=%v, totalFee=%v" ,
791+ fromVertex , minInboundFee , inboundFee ,
792+ amountToSend , amt , totalFee ,
793+ )
794+ }))
795+
786796 if totalFee > 0 && lnwire .MilliSatoshi (totalFee ) > r .FeeLimit {
787797 return
788798 }
@@ -1035,7 +1045,7 @@ func findPath(g *graphParams, r *RestrictParams, cfg *PathFindingConfig,
10351045
10361046 // Check if this candidate node is better than what we
10371047 // already have.
1038- processEdge (fromNode , fromFeatures , edge , partialPath )
1048+ processEdge (fromNode , edge , partialPath )
10391049 }
10401050
10411051 if nodeHeap .Len () == 0 {
0 commit comments