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; }
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; }