Pekka Niiranen wrote: > does not using tuple (name, keyp, cost) as key make access time linear? I don't see how the kind of key can influence the big-O behaviour of a dict. A hash is a hash is a hash, after all. Or am I missing something? Peter