Hi Mike, My experience tells me that in practice it's really difficult to tell which nodes should be expanded (where this "cost" of binary lookup would significantly outweight a direct offset jump). I had some luck in speeding up (very intensive) lookups by creating a hash of [node, arc label] => node for those paths which were frequently accessed... perhaps such a "hot path" cache would be better (compared to static expansion of all outgoing arcs)?
Dawid --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
