in reply to Re^3: search overlap paths
in thread search overlap paths
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.
|
|---|