词语解释 | 本词语解释贡献者:
include "pch.h" #include #include #include #include #include #include #include #include #include using namespace std; struct Edge { int from; int to; int weight; }; struct Node { int id; int distance; int parent; }; struct Graph { vector nodes; vector edges; }; Graph ReadGraph(string filename) { Graph g; ifstream input(filename); string line; while (getline(input, line)) { istringstream iss(line); int from, to, weight; iss >> from >> to >> weight; g.edges.push_back({ from, to, weight }); } input.close(); set nodes; for (auto edge : g.edges) { nodes.insert(edge.from); nodes.insert(edge.to); } for (auto node : nodes) { g.nodes.push_back({ node, INT_MAX, -1 }); } return g; } void PrintGraph(Graph g) { for (auto edge : g.edges) { cout << edge.from << " " << edge.to << " " << edge.weight << endl; } } void PrintNodes(Graph g) { for (auto node : g.nodes) { cout << node.id << " " << node.distance << " " << node.parent << endl; } } bool Relax(Edge edge, Graph& g) { if (g.nodes[edge.to].distance > g.nodes[edge.from].distance + edge.weight) { g.nodes[edge.to].distance = g.nodes[edge.from].distance + edge.weight; g.nodes[edge.to].parent = edge.from; return true; } return false; } bool BellmanFord(Graph& g) { g.nodes[0].distance = 0; for (int i = 0; i < g.nodes.size() - 1; i++) { for (auto edge : g.edges) { Relax(edge, g); } } for (auto edge : g.edges) { if (Relax(edge, g)) { return false; } } return true; } int main() { Graph g = ReadGraph("graph.txt"); PrintGraph(g); cout << endl; if (BellmanFord(g)) { cout << "No negative cycles" << endl; PrintNodes(g); } else { cout << "Negative cycle" << endl; } return 0; }
抱歉，此页面的内容受版权保护，复制需扣除次数，次数不足时需付费购买。
如需下载请点击：点击此处下载
扫码付费即可复制
Live CD ISO | 瀵奸 | 棰戝垎澶氬潃 | 鍗曡浇娉� | 绌哄彛 | earth station | 绌洪棿绔� | NAS灞� | 鍥炵幆鍦板潃 | Qemu-Guest-Agent | QGA | unix socket |
开放、专业、智能的通信词语解释大全
