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".
上面的系列应该是解释啥叫snake,当然这里的snake不是蛇的意思，希望帮解释清啥是snake
1楼的，请不要来捣乱，我不要什么翻译软件翻过来的东西。。。谢谢
2楼的，先谢谢，上面的这段话应该是跟蛇没有任何关系，我感觉是路径或是轨迹的寓意，这段对话是基于计算机图论的一个算法的其中一段话，我确实没看明白，希望大家帮我翻译下
3楼的，首先非常谢谢你，但是我不需要那么多的你收集的单词翻译（不好意思，我比较直接），snake的确是弯曲前进的寓意，但上面的话究竟是什么意思呢？尤其是：
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".