GraphColoring/main.cpp at master · thiagofsr97/GraphColoring · 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
#include <iostream>
#include <FileReader.h>
#include <AttemptHeuristic.h>
#include <ColorTestHeuristic.h>
#include "Dsatur.h"
#include "PermutationHeuristic/ColorClassHeuristic.h"

enum Heuristic {ByAttempts,ByFullColorTest};

int main() {
    FileReader fileReader("InputGood.txt");
    Graph *graph = fileReader.createGraph();
    Heuristic heuristic;
//    Heuristic heuristic = ByFullColorTest;

    Dsatur dsatur(graph);
    dsatur.ColorGraph();

    ColorClassHeuristic *colorClassHeuristic;

    switch(heuristic){
        case ByAttempts:
            colorClassHeuristic = new AttemptHeuristic(1000, graph, dsatur.getColorClass(),dsatur.getNumberOfColors());
            break;
        case ByFullColorTest:
            colorClassHeuristic = new ColorTestHeuristic(graph, dsatur.getColorClass(),dsatur.getNumberOfColors());
            break;
    }

    colorClassHeuristic->dropBucket();


    fileReader.WriteFirstResult(dsatur.getColorClass());
    fileReader.WriteOptimalResult(colorClassHeuristic->getOptimalSolution());


    return 0;
}