I was first thinking of a simple (possibly recursive) tree-walking algorithm, but given the possibility of crossing the 1800-2000 gap using the 1000-2000 link, the right solution is probably quite different.
In reply to Re^4: search overlap paths
by Laurent_R
in thread search overlap paths
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |