cppdescent.hpp

 
#include "ADTGraph.hpp"
#include "ADTVector.hpp"
 
typedef float (*DistanceFunc)(Pointer a, Pointer b);
extern bool verbose;
 
namespace cppdescent {
int compareGraphVertices(Pointer vertex1, Pointer vertex2);
 
int compareGraphVertexPairs(Pointer p1, Pointer p2);
 
// ================================ I/O ======================================
Vector* readBinData(const char* fp, int dimensions);
 
void writeBinGraph(const char* fp, Graph* graph, int K);
 
Graph* readBinGraph(const char* fp, int dimensions);
 
// ============================ Helper Functions =============================
float recall(Graph* bfGraph, Graph* nnGraph, int N, int K);
 
// ============================ Metric Functions =============================
float euclideanDistance(Pointer a, Pointer b);
float manhattanDistance(Pointer a, Pointer b);
int compareEdgesEuclidean(Pointer first, Pointer second);
 
int compareVertexPairsEuclidean(Pointer first, Pointer second);
int compareEdgesManhattan(Pointer first, Pointer second);
 
// ============================= KNN computation =============================
Graph* KNNBruteForceGraph(Vector* data, int K, CompareFunc compare);
Graph* NNDescent_KNNGraph(Vector* data,
                          int K,
                          int D,
                          int Trees,
                          float delta,
                          float rho,
                          DistanceFunc distance);
PQueue* NNDescent_Query(Graph* graph,
                        int K,
                        CompareFunc compare,
                        Vector* query);
 
// ========================= Random Projection Trees =========================
 
void RPTree(Graph* graph, Vector* vec, int K, int D, int dimensions);
 
};  // namespace cppdescent