本文整理汇总了C++中Grafo::getAdjacents方法的典型用法代码示例。如果您正苦于以下问题：C++ Grafo::getAdjacents方法的具体用法？C++ Grafo::getAdjacents怎么用？C++ Grafo::getAdjacents使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类Grafo的用法示例。
在下文中一共展示了Grafo::getAdjacents方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: while
void Prim2opt::preorderTreeWalk(Grafo<unsigned int> &g, unsigned int v, unsigned int visited[], list<unsigned int> &S) {
visited[v] = 1;
S.push_back(v);
list<unsigned int> adj;
g.getAdjacents(v, adj);
list<unsigned int>::iterator it = adj.begin();
while(it != adj.end()) {
if(!visited[*it]){
preorderTreeWalk(g, *it, visited, S);
}
it++;
}
}示例2: getMinimumSpanningTree
Grafo<unsigned int> Prim2opt::getPrim(Grafo<Ciudad> &g, unsigned int vertice) {
unsigned int N = g.getSize();
int root[N];
unsigned int distance[N];
unsigned int visited[N];
for (unsigned int i = 0; i < N; i++) {
distance[i] = INFINITE;
root[i] = -1;
visited[i] = 0;
}
priority_queue <ui_ui, vector<ui_ui>, greater<ui_ui> > pq;
distance[vertice] = 0;
pq.push(ui_ui(0, vertice));
while (!pq.empty()){
unsigned int aux = pq.top().second;
pq.pop();
if (visited[aux] == 1)
continue;
visited[aux] = 1;
list<unsigned int> adj;
g.getAdjacents(aux, adj);
list<unsigned int>::iterator it = adj.begin();
while (it != adj.end()){
unsigned int dist = g.getData(aux, *it).getCost();
if (dist < distance[*it] && !visited[*it]){
distance[*it] = dist;
root[*it] = aux;
pq.push(ui_ui(dist,*it));
}
it++;
}
}
Grafo<unsigned int> mst = getMinimumSpanningTree(root, distance, N, vertice);
return mst;
}