// I plan to use an unusual approach to this problem: it is not based on
// graph traversals but on transformations of directed graphs under which
// the number of paths bettween the start and end is invariant.