1 #ifndef DISCRETEPROXYSOLUTION_H
2 #define DISCRETEPROXYSOLUTION_H
4 #include "../base/solutionprovider.h"
5 #include "../base/discreteproxyprovider.h"
52 return this->proxysets.size();
57 if (i<this->proxysets.size())
58 return this->proxysets[i].size();
64 if (n<this->proxysets.size())
65 if (c<this->proxysets[n].size())
66 return this->proxysets[n][c];
72 if (n<this->proxysets.size())
73 return this->proxysets[n];
74 return std::vector<T*>();
Abstract base class to access the results of proxy / center based clustering algorithms.
virtual std::vector< T * > discrete_proxies(unsigned int n) const
Returns a vector of pointers to the proxies for the specified clustering.
Data structure for discrete proxies.
virtual unsigned int number_of_solutions() const
returns the number of available solutions
std::vector< std::vector< T * > > proxysets
virtual unsigned int size_of_solution(unsigned int) const
returns the size of a particular solution
virtual T * discrete_proxy(unsigned int n, unsigned int c) const
Returns a pointer to the proxy for the specified clustering and cluster.
virtual double computationtime() const
returns the time needed for the last computation
virtual ~DiscreteProxySolution()
Abstract base class for algorithm solutions.