C++實現Bellmanford演算法

來源:互聯網
上載者:User

標籤:

#include<iostream>#include<cctype>#include<sstream>#include<string>#include<algorithm>#include<map>#include<cstring>#include<cstdio>#include<iomanip>#include<vector>#include<queue>using namespace std;const int INF = 100000000;struct Node{int dist;int pre;Node() : dist(INF), pre(-1) {}};int main(void) {cout << "Bellmanford Algorithm for Directed Acyclic Graph: " << endl;while (true) {int nNodes;cout << "Number of Nodes: ";cin >> nNodes;vector<vector<int> > Wgt(nNodes, vector<int>(nNodes, INF));for (int i = 0; i < nNodes; ++i)Wgt[i][i] = 0;int nEdges;cout << "Number of Edges: ";cin >> nEdges;cout << "Src  Dest  Dist(< " << INF << "): " << endl;for (int i = 0; i < nEdges; ++i) {int src, dest, dist;cout << "[" << i << "]: ";cin >> src >> dest >> dist;Wgt[src][dest] = dist;}for (int i = 0; i < nNodes; ++i) {for (int j = 0; j < nNodes; ++j) {if (Wgt[i][j] != INF)cout << " " << setw(3) << Wgt[i][j];elsecout << " " << "INF";}cout << endl;}//Bellmanford//INITIALIZE_SINGLE_SOURCEvector<Node> Rec(nNodes);Rec[0].dist = 0;//RELAXfor (int k = 0; k < nNodes - 1; ++k)//nNodes steps.for (int i = 0; i < nNodes; ++i) {for (int j = 0; j < nNodes; ++j) {if (Wgt[i][j] != INF)if (Rec[j].dist > Wgt[i][j] + Rec[i].dist) {Rec[j].dist = Wgt[i][j] + Rec[i].dist;Rec[j].pre = i;}}}//CHECK_WEIGHTfor (int i = 0; i < nNodes; ++i) {for (int j = 0; j < nNodes; ++j) {if (Wgt[i][j] != INF)if (Rec[j].dist > Wgt[i][j] + Rec[i].dist) {cout << "Negative weight circut." << endl;}}}for (int i = 0; i < nNodes; ++i) {cout << "[" << i << "]  Dist: " << Rec[i].dist << ", Pre: " << Rec[i].pre << endl;}}return 0;}

C++實現Bellmanford演算法

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.