K-Nearest Neighbor Graph Testing Library
C++ Python library that is able to import exisiting NN-structures; Implements Property Testing Algorithm that rejects with high probability if queries to given structure are epsilon-far from giving a K-Nearest Neighbor Graph
Classes | Public Types | Public Member Functions | Static Public Member Functions | Protected Attributes | List of all members
KNN_Graph< T > Class Template Reference
Inheritance diagram for KNN_Graph< T >:
KNN_Graph_Exact< T >


class  Adjacency_List

Public Types

typedef unsigned long long index_type
typedef Tuple< T > location_type
typedef Relation< T > vertices_type
typedef Adjacency_List adjacency_list_type
typedef std::vector< adjacency_list_typeedges_type

Public Member Functions

 KNN_Graph (const unsigned long k)
void sort ()
auto epsilon (const KNN_Graph< T > &hp) const
auto dimension () const
auto number_vertices () const
auto number_edges () const
auto number_wrongly_connected_vertices () const
auto get_vertex (const index_type i) const
auto get_neighbors (const index_type i) const
auto number_neighbors (const index_type i) const
auto get_k () const
void add_edge (const index_type i, const index_type j)
virtual void build (const vertices_type &vertices)
virtual void build (const np::ndarray &in)
void edges_from_ndarray (const np::ndarray &in)
const auto & get_edges () const
const auto & get_vertices () const
auto & get_edges ()
auto & get_vertices ()
auto edges_begin () const
auto edges_end () const
auto vertices_begin () const
auto vertices_end () const
auto as_str () const
auto repr () const

Static Public Member Functions

static T euclidean_distance (const location_type &a, const location_type &b)
static T euclidean_distance_squared (const location_type &a, const location_type &b)

Protected Attributes

unsigned long k
unsigned long long edges_number = 0
vertices_type vertices
edges_type edges

The documentation for this class was generated from the following file: