Skip to content

everpeace/bk-tree

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

This is an implementation of BK-Tree, which has competitive characotrs:
1)It provides effective search in a given metric space.
2)The structure is very simple.
3)In pragmatic situation, tree-height is balanced. i.e. height is O(log n) where n is the number of elements in the tree.

More about BK-Tree, see: 
http://en.wikipedia.org/wiki/BK-tree
http://blog.notdot.net/2007/4/Damn-Cool-Algorithms-Part-1-BK-Trees

About

implementation of bk-tree, which provides effective search in a given metric space.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages