OMA_ExamTimeTable/utils.h at master · Jacopx/OMA_ExamTimeTable · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
 *          OMA Project of Jacopo Maggio, Stefano Munna, Jacopo Nasi, Andrea Santu and Marco Torlaschi               *
 *                      Repository available on https://github.com/Jacopx/OMA_ExamTimeTable                          *
 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

#include "ADTgraph.h"
#include "ST.h"
#include "verbose.h"

#ifndef OMA_EXAMTIMETABLE_UTILS_H
#define OMA_EXAMTIMETABLE_UTILS_H

typedef struct {
    int *exams;
    int E, timeSlots;
    Graph g;
    st tab;
    int timeLimit;
    int S;
} dataStructure;

typedef struct {
    int *temporarySolution;
    int currentTimeSlot;
    int tempSolConflicts;
    int numConflictBestSolution;
    int length;
} TempSol;

TempSol* newTempSol (dataStructure* sol);
void freeTempSol (TempSol *ts);
float benchmarkSolution (dataStructure *solution,int * testSol);
float benchmarkSolutionDeltaMove(dataStructure *solution,int * testSol,int exam, int oldSlot,int newSlot);
float benchmarkSolutionSwap(dataStructure* solution,int *testSol,int e1, int e2);
int isFeasible(dataStructure * ,const int *);
int isFeasibleThis(dataStructure * ,const int *,int exam,int slot);
int isFeasibleSwap(dataStructure * ,const int *,int e1,int e2);
int isFeasibleSwap3(dataStructure * solution,const int * temp,int e1,int e2, int e3);
void findFeasibleSolution (dataStructure *solution,TempSol *Tsol,int maxTime);
void extendSol(dataStructure* sol,TempSol*);
void copyArray (int *s1, const int *s2, int l);
int arrayEquals (const int *s1, const int *s2,int l);
void findFeasibleGreedyCi(dataStructure *, TempSol *);
#endif //OMA_EXAMTIMETABLE_UTILS_H