Version 5.0 The LEDA User Manual

An example for an algorithm that supports the first two decisions is:
class Algorithm {
int state, endstate;
public:
Algorithm(int max) : endstate(max), state(0) { }
void next() { state++; }
bool finished() { return state>=endstate; }
};
With this class Algorithm we can easily instantiate an algorithm object:
Algorithm alg(5);
while (!alg.finished()) alg.next();
This small piece of code creates an algorithm object and invokes “next()” until it has
reached an end state.
An advantage of this design is that we can write basic algorithms, which can be used in
a standardized way and if needed, inspection of internal states and variables can be provided
without writing complex code. Additionally, it makes it possible to write persistent
algorithms, if the member variables are persistent.
Actually, those algorithms are quite more flexible than ordinary written algorithm functions:
template
class OutputAlg {
Alg alg;
public:
OutputAlg(int m) : alg(m) {
cout