Genetic-String-Mapping-Algorithm/src/MainFile.cpp at main · vatsalcode/Genetic-String-Mapping-Algorithm · GitHub

History

112 lines (96 loc) · 3.01 KB

Raw

100

101

102

103

104

105

106

107

108

109

110

111

112

#include "../include/GeneSequence.h"

extern time_t startingTime, currentTime;

extern int timeLimit;

extern vector<string> answerReport;

extern int costReport;

extern bool reversed;

extern bool answerReverse;

int main(int argc, char *argv[]){

// cout<<argc<<endl;

// return 0;

if(argc == 3){

string inputFileName(argv[1]);

string outputFileName(argv[2]);

ifstream inputFile(inputFileName);

string line;

time_t timestart, timeend;

int vsize, k, cc, i, j;

float execTime;

string tempString;

vector<string> myStrings;

vector<vector<int> > costMap;

vector<int> goalTuple;

vector<int> zeroTuple;

char dumpComma;

inputFile >> execTime;

// cout<<line<<endl; // input for the time limit of the runtime of the code

inputFile >> vsize; // input for vocabulary size and its letters

vector<char> myVocabulary(vsize, '*');

int tempIndex = 0;

for (i = 0; i < vsize-1; i++){

inputFile >> myVocabulary[i] >> dumpComma;

tempIndex = tempIndex + 3;

}

inputFile >> myVocabulary[i];

myVocabulary.push_back('-');

// for(int i=0;i<myVocabulary.size();i++){

// cout<<myVocabulary[i]<<" " << vsize << endl;

// }

// cout<<endl;

inputFile >> k; // input for number of strings and the strings

for (i = 0; i < k; i++){

inputFile >> tempString;

// tempString.erase(remove(tempString.begin(), tempString.end(),' '), tempString.end());

myStrings.push_back(tempString);

goalTuple.push_back(tempString.length());

zeroTuple.push_back(0);

}

inputFile >> cc; // input for conversion cost

string falseString;

int tempInt; // input for matching cost matrix

for (i = 0; i < vsize + 1; i++) {

vector<int> tempVector;

// getline(inputFile, line);

tempIndex = 0;

for (j = 0; j < vsize + 1; j++){

inputFile >> tempInt;

// tempIndex = tempIndex + 2;

tempVector.push_back(tempInt);

}

costMap.push_back(tempVector);

}

// for(int i=0;i<costMap.size();i++){

// for(int j=0;j<costMap[0].size();j++){

// cout<<costMap[i][j]<<" ";

// }

// cout<<endl;

// }

char hash;

inputFile.close();

time(&timestart);

startingTime = timestart;

timeLimit = (int)(execTime * 60 - 5);

GeneSequence* genes = new GeneSequence(vsize + 1, myVocabulary, k, myStrings, cc, costMap);

HillClimbingState startState(myStrings);

int maxlen = genes->maxStringLength(myStrings) + 15;

int finalCost1 = genes->localSearch(startState, maxlen);

for (int i = 0; i < k; i++)

reverse(startState.orientation[i].begin(), startState.orientation[i].end());

reversed = 1;

int finalCost2 = genes->localSearch(startState, maxlen);

answerReport = genes->balanceStrings(answerReport);

ofstream outputFile(outputFileName);

for(int i=0;i<answerReport.size();i++){

if(answerReverse){

reverse(answerReport[i].begin(), answerReport[i].end());

}

outputFile << answerReport[i] << endl;

}

cout << "The cost value is: " << costReport << endl;

time(&timeend);

}

else{

cerr<<"Wrong Arguments"<<endl;

}

return 0;

}

Genetic-String-Mapping-Algorithm/src/MainFile.cpp at main · vatsalcode/Genetic-String-Mapping-Algorithm · GitHub

Expand file tree

Breadcrumbs

MainFile.cpp

Latest commit

History

Breadcrumbs

MainFile.cpp

File metadata and controls