Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 12]
| ▼NEvolutionaryAlgorithm | |
| CAlgorithm | Base abstract class for all optimization algorithms |
| CCrossover | Abstract base class for crossover implementations |
| CGeneticAlgorithm | Representation of genetic algorithm. Glues everything together |
| CLAXCrossover | Implementation of Least Assignments Crossover |
| CMutator | Base class for mutation operators |
| COnePointCrossover | Implementation of one-point crossover |
| CPopulation | Representation of population, i.e. set of specimen (schedules) |
| CSelector | Base abstract class for selection operators |
| CSimpleMutator | Implementation of simple mutation operator |
| CTournamentSelector | Implementation of tournament selection operator |
| CUniformCrossover | Implementation of uniform crossover |
| ▼NSchedulingProblem | |
| CPrioSchedule | Representation of schedule that uses task priorities |
| CProject | Singleton representation of project in the scheduling problem |
| CProjectReader | Input reader of Project |
| CSchedule | Base abstract class for specimen (schedule) representations |
| CSimpleSchedule | Simple representation of schedule |
| CTask | Representation of task |
| CValidator | Interface for validating schedules |
| ▼NUtil | |
| CRandom | Helper class used to generate random values |