diff options
| author | cathook <b01902109@csie.ntu.edu.tw> | 2014-04-22 21:37:53 +0800 |
|---|---|---|
| committer | cathook <b01902109@csie.ntu.edu.tw> | 2014-04-22 21:37:53 +0800 |
| commit | 5d4e65d6209a078fce2ef094ff2cb812b040513e (patch) | |
| tree | db0b58b3192e69457b35671f88073e399a67f657 /meowpp | |
| parent | ac6d2fcb7b1a77455895fa65b42502c9b29823fd (diff) | |
| download | meow-5d4e65d6209a078fce2ef094ff2cb812b040513e.tar meow-5d4e65d6209a078fce2ef094ff2cb812b040513e.tar.gz meow-5d4e65d6209a078fce2ef094ff2cb812b040513e.tar.bz2 meow-5d4e65d6209a078fce2ef094ff2cb812b040513e.tar.lz meow-5d4e65d6209a078fce2ef094ff2cb812b040513e.tar.xz meow-5d4e65d6209a078fce2ef094ff2cb812b040513e.tar.zst meow-5d4e65d6209a078fce2ef094ff2cb812b040513e.zip | |
update readme
Diffstat (limited to 'meowpp')
| -rw-r--r-- | meowpp/dsa/KD_Tree.h | 3 | ||||
| -rw-r--r-- | meowpp/dsa/KD_Tree.hpp | 1 | ||||
| -rw-r--r-- | meowpp/dsa/SplayTree.h | 2 | ||||
| -rw-r--r-- | meowpp/dsa/VP_Tree.h | 9 |
4 files changed, 10 insertions, 5 deletions
diff --git a/meowpp/dsa/KD_Tree.h b/meowpp/dsa/KD_Tree.h index 035d6eb..216d9c9 100644 --- a/meowpp/dsa/KD_Tree.h +++ b/meowpp/dsa/KD_Tree.h @@ -1,11 +1,10 @@ #ifndef KD_Tree_H__ #define KD_Tree_H__ -#include <list> #include <vector> #include <cstdlib> #include <queue> -#include <utility.h> +#include "../utility.h" namespace meow{ //# diff --git a/meowpp/dsa/KD_Tree.hpp b/meowpp/dsa/KD_Tree.hpp index f0e97a9..7fea6da 100644 --- a/meowpp/dsa/KD_Tree.hpp +++ b/meowpp/dsa/KD_Tree.hpp @@ -1,5 +1,4 @@ #include <cstdlib> -#include <list> #include <vector> #include <algorithm> #include <queue> diff --git a/meowpp/dsa/SplayTree.h b/meowpp/dsa/SplayTree.h index f8cdd20..69b204e 100644 --- a/meowpp/dsa/SplayTree.h +++ b/meowpp/dsa/SplayTree.h @@ -1,7 +1,7 @@ #ifndef SplayTree_h__ #define SplayTree_h__ -#include "utility.h" +#include "../utility.h" namespace meow{ //# diff --git a/meowpp/dsa/VP_Tree.h b/meowpp/dsa/VP_Tree.h index f8ab393..669eb0f 100644 --- a/meowpp/dsa/VP_Tree.h +++ b/meowpp/dsa/VP_Tree.h @@ -17,6 +17,10 @@ namespace meow{ //# `VP_Tree` 每次選一個點, 將資料分成 離這個點近的, 跟離這個點遠的. //# 至於怎麼選呢...., 嘛還沒研究, 先random //# + //# .參考資料連結: + //# * http://stevehanov.ca/blog/index.php?id=130[link] + //# * http://pnylab.com/pny/papers/vptree/vptree[link] + //# //#==== Template Class Operators Request //#[options="header",width="70%",cols="1>m,1<,3<s,5<,3<,15<",grid="rows"] //#|===================================================================== @@ -128,7 +132,7 @@ namespace meow{ //#|const|query|(Vector const& `v`,\size_t `i`,\bool `cmp`)|Vectors - //#|O(KN ^1-1/K^ ) + //#|O(logN) ~Expected~ //#|於set中找尋距離 `v` 前 `i` 近的向量, 並依照由近而遠的順序排序. //# 如果有兩個向量 `v1`,`v2` 距離一樣, 且 `cmp` 為 `true` , 則直接依照 //# `v1 < v2` 來決定誰在前面. 最後回傳一陣列包含所有解. @@ -154,6 +158,9 @@ namespace meow{ //# //#[NOTE] //#======================================== + //# * 實測結果發覺比 `KD_Tree` 有效率多了... + //# * 'TODO' `insert()`, `erase()` 算是未完成功能 + //# //#======================================== //# //# ''' |