tsp_heuristics::NearestNeighbour Member List

This is the complete list of members for tsp_heuristics::NearestNeighbour, including all inherited members.

AbstractEA()	AbstractEA< S >
AbstractEA(const int &maxEvals, const int &popsize)	AbstractEA< S >
AbstractEA(unique_ptr< PopulationEvaluator< S >>, const int &maxEvals, const int &popsize)	AbstractEA< S >
avgEvolution (defined in AbstractEA< S >)	AbstractEA< S >	protected
createInitialPopulation()	Heuristic< IntFloatSolution >	inlineprotectedvirtual
DEFAULT_EVALUATIONS_LIMIT	AbstractEA< S >	static
DEFAULT_POPULATION_SIZE	AbstractEA< S >	static
ELAPSED_TIME (defined in AbstractEA< S >)	AbstractEA< S >	static
elapsedTime (defined in AbstractEA< S >)	AbstractEA< S >	protected
endTime (defined in AbstractEA< S >)	AbstractEA< S >	protected
evaluatePopulation(vector< IntFloatSolution > &)	Heuristic< IntFloatSolution >	inlineprotectedvirtual
AbstractEA::evaluatePopulation(vector< S > &pop)=0	AbstractEA< S >	protectedpure virtual
evaluator (defined in AbstractEA< S >)	AbstractEA< S >	protected
EVALUATOR (defined in AbstractEA< S >)	AbstractEA< S >	static
evolution (defined in AbstractEA< S >)	AbstractEA< S >	protected
EVOLUTION_SIZE (defined in AbstractEA< S >)	AbstractEA< S >	static
evolutionInterval (defined in AbstractEA< S >)	AbstractEA< S >	protected
finishProgress() override	Heuristic< IntFloatSolution >	protectedvirtual
getElapsedTime() const	AbstractEA< S >	inline
getEvaluator() const	AbstractEA< S >	inline
getEvolution() const	AbstractEA< S >	virtual
getID() const	tsp_heuristics::NearestNeighbour	inlinevirtual
getMaxEvaluations() const	AbstractEA< S >	inline
getName() const	tsp_heuristics::NearestNeighbour	inlinevirtual
getPerformedEvaluations() const	AbstractEA< S >	inline
getPopulation() const	AbstractEA< S >	inline
getPopulationSize() const	AbstractEA< S >	inline
getPrintingInterval() const	AbstractEA< S >	inline
getProblem() const	AbstractEA< S >	inline
getResults() const override	tsp_heuristics::NearestNeighbour	virtual
Heuristic()=default (defined in Heuristic< IntFloatSolution >)	Heuristic< IntFloatSolution >
initProgress()	Heuristic< IntFloatSolution >	inlineprotectedvirtual
isStoppingConditionReached() override	Heuristic< IntFloatSolution >	inlineprotectedvirtual
MAX_EVALUATIONS (defined in AbstractEA< S >)	AbstractEA< S >	static
maxEvaluations	AbstractEA< S >	protected
NAME (defined in AbstractEA< S >)	AbstractEA< S >	static
NearestNeighbour() (defined in tsp_heuristics::NearestNeighbour)	tsp_heuristics::NearestNeighbour
nextCheckpoint (defined in AbstractEA< S >)	AbstractEA< S >	protected
performedEvaluations (defined in AbstractEA< S >)	AbstractEA< S >	protected
POP_SIZE (defined in AbstractEA< S >)	AbstractEA< S >	static
population (defined in AbstractEA< S >)	AbstractEA< S >	protected
populationSize	AbstractEA< S >	protected
problem (defined in AbstractEA< S >)	AbstractEA< S >	protected
run() override	tsp_heuristics::NearestNeighbour	virtual
setEvaluator(unique_ptr< PopulationEvaluator< S >> eval)	AbstractEA< S >	inline
setMaxEvaluations(int maxEval)	AbstractEA< S >	inline
setPerformedEvaluations(int pEvals)	AbstractEA< S >	inline
setPopulation(const vector< S > &pop)	AbstractEA< S >
setPopulationSize(int pSize)	AbstractEA< S >
setProblem(shared_ptr< TSP > prob) (defined in tsp_heuristics::NearestNeighbour)	tsp_heuristics::NearestNeighbour
setProblem(TSP *prob) (defined in tsp_heuristics::NearestNeighbour)	tsp_heuristics::NearestNeighbour
Heuristic< IntFloatSolution >::setProblem(shared_ptr< Problem< S >> prob)	AbstractEA< S >	inlinevirtual
Heuristic< IntFloatSolution >::setProblem(Problem< S > *prob)	AbstractEA< S >	inlinevirtual
startTime (defined in AbstractEA< S >)	AbstractEA< S >	protected
to_json() const	Heuristic< IntFloatSolution >	virtual
updateEvolution(vector< IntFloatSolution > &)	Heuristic< IntFloatSolution >	inlineprotectedvirtual
updateEvolution(const int &checkpoint, vector< IntFloatSolution > &)	Heuristic< IntFloatSolution >	inlineprotectedvirtual
AbstractEA::updateEvolution(vector< S > &pop)	AbstractEA< S >	protectedvirtual
AbstractEA::updateEvolution(const int &checkpoint, vector< S > &)	AbstractEA< S >	protectedvirtual
updateProgress()	Heuristic< IntFloatSolution >	inlineprotectedvirtual
~AbstractEA() (defined in AbstractEA< S >)	AbstractEA< S >	virtual
~Heuristic()=default (defined in Heuristic< IntFloatSolution >)	Heuristic< IntFloatSolution >	virtual
~NearestNeighbour()=default (defined in tsp_heuristics::NearestNeighbour)	tsp_heuristics::NearestNeighbour	virtual