The authors’ second, more substantive assumption was that a fast path-finding algorithm would remain “rooted” — that is, it would build up a path to the exit node without ever losing track of the ...