Class FastBKTree

source code

object --+
         |
        FastBKTree

Simpler version of BKTree. The tree's content is kept in nested
dictionaries where a "node"'s value is simply stored at key -1 and
its children are stored using their distance to the value as the
key. Example:

self.root = { -1: 'ABC',
               0: { -1: 'ABC' }
               1: { -1: 'ABCD',
                     1: { -1: 'ABCE' }
                  }
               2: { -1: 'A',
                     1: { -1: 'B',
                           1: { -1: 'C' } 
                        }
                  }
            }