您好,登錄后才能下訂單哦!
C++算法庫中最常用的最短路徑算法是Dijkstra算法和Floyd-Warshall算法。
C++標(biāo)準(zhǔn)庫中提供了std::priority_queue和std::vector等數(shù)據(jù)結(jié)構(gòu)來實(shí)現(xiàn)Dijkstra算法。以下是Dijkstra算法的偽代碼:
void Dijkstra(Graph graph, int source) {
int n = graph.size();
vector<int> dist(n, INT_MAX);
dist[source] = 0;
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
pq.push({0, source});
while (!pq.empty()) {
int u = pq.top().second;
pq.pop();
for (auto& edge : graph[u]) {
int v = edge.first;
int weight = edge.second;
if (dist[u] + weight < dist[v]) {
dist[v] = dist[u] + weight;
pq.push({dist[v], v});
}
}
}
}
C++標(biāo)準(zhǔn)庫中提供了std::vector等數(shù)據(jù)結(jié)構(gòu)來實(shí)現(xiàn)Floyd-Warshall算法。以下是Floyd-Warshall算法的偽代碼:
void FloydWarshall(Graph graph) {
int n = graph.size();
vector<vector<int>> dist(n, vector<int>(n, INT_MAX));
for (int i = 0; i < n; ++i) {
dist[i][i] = 0;
for (auto& edge : graph[i]) {
int j = edge.first;
int weight = edge.second;
dist[i][j] = weight;
}
}
for (int k = 0; k < n; ++k) {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (dist[i][k] != INT_MAX && dist[k][j] != INT_MAX && dist[i][k] + dist[k][j] < dist[i][j]) {
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
}
}
這兩種算法都能有效地求解最短路徑問題,具體選擇哪一種算法取決于具體的應(yīng)用場景和需求。
免責(zé)聲明:本站發(fā)布的內(nèi)容(圖片、視頻和文字)以原創(chuàng)、轉(zhuǎn)載和分享為主,文章觀點(diǎn)不代表本網(wǎng)站立場,如果涉及侵權(quán)請聯(lián)系站長郵箱:is@yisu.com進(jìn)行舉報(bào),并提供相關(guān)證據(jù),一經(jīng)查實(shí),將立刻刪除涉嫌侵權(quán)內(nèi)容。