UndirectedGraph* GreedyHeuristic::getICTree(UndirectedGraph* t1, UndirectedGraph* t2, list<Edge*>* iset, UndirectedGraph* ug) {
int cardinality = ((*t1).vertices).size() - 1;
UndirectedGraph* greedyTree = new UndirectedGraph();
//cout << "iset size: " << iset->size() << endl;
Edge* minE = getMinEdge(iset);
greedyTree->addVertex(minE->fromVertex());
greedyTree->addVertex(minE->toVertex());
greedyTree->addEdge(minE);
generateUCNeighborhoodFor(ug,minE);
for (int k = 2; k < ((*ug).vertices).size(); k++) {
Edge* newEdge = getICNeighbor(iset);
Vertex* newVertex = NULL;
if (greedyTree->contains(newEdge->fromVertex())) {
newVertex = newEdge->toVertex();
}
else {
newVertex = newEdge->fromVertex();
}
greedyTree->addVertex(newVertex);
greedyTree->addEdge(newEdge);
adaptUCNeighborhoodFor(newEdge,newVertex,greedyTree,ug);
}
if ((greedyTree->vertices).size() > (cardinality + 1)) {
shrinkTree(greedyTree,cardinality);
}
greedyTree->setWeight(weightOfSolution(greedyTree));
return greedyTree;
}
void GreedyHeuristic::getGreedyHeuristicResult(UndirectedGraph* aTree, int cardinality, string ls_type) {
UndirectedGraph* greedyTree = new UndirectedGraph();
bool started = false;
for (list<Edge*>::iterator anEdge = ((*graph).edges).begin(); anEdge != ((*graph).edges).end(); anEdge++) {
greedyTree->clear();
greedyTree->addVertex((*anEdge)->fromVertex());
greedyTree->addVertex((*anEdge)->toVertex());
greedyTree->addEdge(*anEdge);
generateNeighborhoodFor(*anEdge);
for (int k = 1; k < cardinality; k++) {
Edge* kctn = getMinNeighbor();
Vertex* nn = determineNeighborNode(kctn,greedyTree);
greedyTree->addVertex(nn);
greedyTree->addEdge(kctn);
adaptNeighborhoodFor(kctn,nn,greedyTree);
}
if (!(ls_type == "no")) {
/* application of local search */
if (ls_type == "leafs") {
LocalSearch lsm(graph,greedyTree);
lsm.run(ls_type);
}
else {
if (ls_type == "cycles_leafs") {
//cout << *greedyTree << endl;
LocalSearchB lsm;
lsm.run(graph,greedyTree);
}
}
/* end local search */
/*
if (!isConnectedTree(greedyTree)) {
cout << "non-connected tree" << endl;
}
*/
}
greedyTree->setWeight(weightOfSolution(greedyTree));
if (started == false) {
started = true;
aTree->copy(greedyTree);
}
else {
if ((greedyTree->weight()) < (aTree->weight())) {
aTree->copy(greedyTree);
}
}
}
delete(greedyTree);
}
UndirectedGraph* GreedyHeuristic::uniteOnCommonBase(UndirectedGraph* t1, UndirectedGraph* t2, list<Edge*>* is) {
UndirectedGraph* ugh = new UndirectedGraph();
for (list<Vertex*>::iterator v = ((*t1).vertices).begin(); v != ((*t1).vertices).end(); v++) {
ugh->addVertex(*v);
}
for (list<Vertex*>::iterator v = ((*t2).vertices).begin(); v != ((*t2).vertices).end(); v++) {
if (!(ugh->contains(*v))) {
ugh->addVertex(*v);
}
}
for (list<Edge*>::iterator e = ((*t1).edges).begin(); e != ((*t1).edges).end(); e++) {
ugh->addEdge(*e);
}
for (list<Edge*>::iterator e = ((*t2).edges).begin(); e != ((*t2).edges).end(); e++) {
if (!(ugh->contains(*e))) {
ugh->addEdge(*e);
}
else {
is->push_back(*e);
}
}
return ugh;
}
