title: Levenshtein Distance: Inferring the edit operations from the matrix
body: <p>I wrote Levenshtein algorithm in in C++</p>
  
  <p>If I input:<br>
  string s: democrat<br>
  string t: republican<br></p>
  
  <p>I get the matrix D filled-up and the number of operations (the Levenshtein distance) can be read in D[10][8] = 8<br>
  Beyond the filled matrix I want to construct the optimal solution. How must look this solution? I don't have an idea.<br>
  Please only write me HOW MUST LOOK for this example.</p>