The problem of finding a shortest edit script reduces to finding a path from (0,0) to (N,M) with the fewest
number of horizontal and vertical edges. Let a D-path be a path starting at (0,0) that has exactly D non-diagonal
edges. A 0-path must consist solely of diagonal edges. By a simple induction, it follows that a D-path must consist
of a (D − 1)-path followed by a non-diagonal edge and then a possibly empty sequence of diagonal edges called a
snake.
问题是从By a simple induction ... 开始, 弄不清之后的几个定语是修饰哪个名词.
1. 在followed by a non-diagnal edge修饰的是D-path还是(D-1)-path?
2. and then是和it follows并列还是和a non-diagnal并列?
3. called a snake是修饰diagonal edges? a D-path? a (D-1)-path? a non-diagonal edge? a possibly empty sequence?