Each node in the directed graph is a candidate alignment and each edge denotes a transition between two nodes by adding a link.
that is we can remove most of the computational overhead by calculating only the difference of scores instead of the scores themselves.