Merge pull request #73 from AntonisZks/stavros_workstation

Implemented basic structure of the filtered medoid

Author: StavrosJKw

include/Algorithms/VamanaIndex.h

@@ -364,6 +364,29 @@ template <typename vamana_t> class VamanaIndex {
     return *medoid_node;
   }
 
+  using namespace std;
+  
+  map<string, int> FilteredMedoid(const Graph<T>& P, int threshold){
+
+    /*
+
+    method of the Graph class that returns the noodeds as a set
+    
+    */
+
+    //Variables
+    set<int> Filters;//this is the set of all the filters (i.e. categorical attributes)
+    map<string,int> M; //this will be a map of Medoid for every filter's set of nodes
+
+    //Algorithm Loop
+    for(int f : Filters){
+
+
+    }
+
+    return M;
+  }
+
   /**
    * @brief tests a specific Vamana index and prints its accuracy. Specifically this method is used to evaluate
    * a Vamana Index Graph, by searching inside the graph for the nearest neighbors of a given query point, and