title: dynamic programming pseudocode for Travelling Salesman
body: <p>this is a dynamic programming pseudocode for TSP (Travelling Salesman Problem). i understood its optimal substructure but i can't figure out what the code in red brackets do.</p>
  
  <p>i am not asking anyone to write the actual code, i just need explanation on what is happening so i can write my own.... thanks:)</p>
  
  <p>here is a link for the pseudocode, i couln't uploaded over here.
  <a href="http://www.imagechicken.com/viewpic.php?p=1266328410025325200&amp;x=jpg" rel="nofollow noreferrer">http://www.imagechicken.com/viewpic.php?p=1266328410025325200&amp;x=jpg</a></p>