Edited 12_path_finding.asciidoc with Atlas code editor

12_path_finding.asciidoc

@@ -142,11 +142,11 @@ Most Lightning node and wallet implementations improve on this approach by order
 
 . Find paths connecting the sender to the recipient.
 
-. Order the paths by some weight (this may be part of the previous step's algorithm).
+. Order the paths by some weight (this may be part of the previous step's pass:[<span class="keep-together">algorithm</span>]).
 
 . Try each path in order until payment succeeds (the trial-and-error loop).
 
-. Optionally use the HTLC failure returns to update our graph, reducing uncertainty.
+. Optionally use the HTLC failure returns to update our graph, reducing pass:[<span class="keep-together">uncertainty</span>].
 
 We can group these steps into three primary activities:
 
@@ -353,7 +353,7 @@ image::images/mtln_1208.png[]
 
 ===== Learning from success
 
-Selena has also learnt a lot from this successful payment. She now knows that all the channels on the path S->A->B->X->Y->R  had enough liquidity to deliver the payment. Furthermore, she now knows that each of these channels has moved the HTLC amount (1M &#x2b; fees) to the other end of the channel. This allows Selena to recalculate the range of liquidity on the receiving side of all the channels in that path, replacing the minimum liquidity with 1M &#x2b; fees.
+Selena has also learned a lot from this successful payment. She now knows that all the channels on the path S->A->B->X->Y->R  had enough liquidity to deliver the payment. Furthermore, she now knows that each of these channels has moved the HTLC amount (1M &#x2b; fees) to the other end of the channel. This allows Selena to recalculate the range of liquidity on the receiving side of all the channels in that path, replacing the minimum liquidity with 1M &#x2b; fees.
 
 ===== Stale knowledge?