menu
ml_algo package
documentation
kd_tree.dart
kd_tree.dart
dark_mode
light_mode
kd_tree
library
Classes
KDTree
KD-tree - an algorithm that provides efficient data retrieval by splitting the whole searching space into partitions in form of binary tree which means that data querying on average will take O(log(n)) time
Enums
Distance
A type of vector distance
DType
A type, denoting, how data will be stored and processed in vectors or matrices
ml_algo package
documentation
kd_tree.dart
ml_algo
package
Libraries
kd_tree
ml_algo
kd_tree library