72 Zeilen
1,7 KiB
Java
72 Zeilen
1,7 KiB
Java
package org.insa.algo;
|
|
|
|
import java.time.Duration;
|
|
import java.time.Instant;
|
|
import java.util.ArrayList;
|
|
|
|
public abstract class AbstractAlgorithm<Observer> {
|
|
|
|
protected AbstractInputData data;
|
|
protected ArrayList<Observer> observers;
|
|
|
|
/**
|
|
* @param data
|
|
*/
|
|
protected AbstractAlgorithm(AbstractInputData data) {
|
|
this.data = data;
|
|
this.observers = new ArrayList<Observer>();
|
|
}
|
|
|
|
/**
|
|
* @param data
|
|
* @param observers
|
|
*/
|
|
protected AbstractAlgorithm(AbstractInputData data, ArrayList<Observer> observers) {
|
|
this.data = data;
|
|
this.observers = observers;
|
|
;
|
|
}
|
|
|
|
/**
|
|
* Add an observer to this algorithm.
|
|
*
|
|
* @param observer
|
|
*/
|
|
public void addObserver(Observer observer) {
|
|
observers.add(observer);
|
|
}
|
|
|
|
/**
|
|
* @return The list of observers for this algorithm.
|
|
*/
|
|
public ArrayList<Observer> getObservers() {
|
|
return observers;
|
|
}
|
|
|
|
/**
|
|
* @return Instance corresponding to this algorithm.
|
|
*/
|
|
public AbstractInputData getInputData() {
|
|
return data;
|
|
}
|
|
|
|
/**
|
|
* Run the algorithm and update the current solution.
|
|
*
|
|
* @return true if a feasible solution was found (even non-optimal).
|
|
*/
|
|
public AbstractSolution run() {
|
|
Instant start = Instant.now();
|
|
AbstractSolution solution = this.doRun();
|
|
solution.setSolvingTime(Duration.between(start, Instant.now()));
|
|
return solution;
|
|
}
|
|
|
|
/**
|
|
* Abstract method that should be implemented by child class.
|
|
*
|
|
* @return A solution, if one was found, or null.
|
|
*/
|
|
protected abstract AbstractSolution doRun();
|
|
|
|
}
|