Does anyone know of an efficient (or at least polynomial in the worst case) way to map a local DS node to all complete and/or global nodes it may correspond to in any of the function's callers? Thanks, --Patrick -- If I'm not here, I've gone out to find myself. If I get back before I return, please keep me here.
Possibly Parallel Threads
Wisdom of the Ancients
