Enter initial(A) and target(B) strings and click enter to see shortest edit paths.
I use dynamic programming to find the shortest edit distance (Optimal String Aligment), and then backtrack through the resulting matrix to figure out the paths the algorithm made.