?? bbtsp.cpp
字號:
// test branch-and-bound travelisng salesperson#include <iostream.h>#include "awd.h"void main(void){ AdjacencyWDigraph<int> G(7); int i, n = 7, p[8]; cout << "enter number of edges of 7 vertex graph" << endl; int e, u, v, c; cin >> e; for (i =1; i <= e; i++) { cout << "enter edge " << i << endl; cin >> u >> v >> c; G.Add(u,v,c);} cout << "Cost = " << G.BBTSP(p) << endl; cout << "Optimal tour is" << endl; for (i = 1; i <= n; i++) cout << p[i] << ' '; cout << endl;}
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -