本文整理汇总了C++中UndirectedGraph::clear方法的典型用法代码示例。如果您正苦于以下问题:C++ UndirectedGraph::clear方法的具体用法?C++ UndirectedGraph::clear怎么用?C++ UndirectedGraph::clear使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类UndirectedGraph
的用法示例。
在下文中一共展示了UndirectedGraph::clear方法的1个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: getGreedyHeuristicResult
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);
}