btsp.cpp

来自「一本全面剖析C++数据结构算法的书籍」· C++ 代码 · 共 25 行

// test backtracking traveling salesperson

#include <iostream.h>
#include "awd.h"

void main(void)
{
   AdjacencyWDigraph<int> G(7);
   int n = 7, p[8];
   cout << "enter number of edges of 7 vertex digraph" << endl;
   int e, u, v, c;
   cin >> e;
   for (int i =1; i <= e; i++) {
    cout << "enter edge " << i << endl;
    cin >> u >> v >> c;
    G.Add(u,v,c);}

   cout << "Cost = " << G.TSP(p) << endl;

   cout << "Optimal tour is" << endl;
   for (int i = 1; i <= n; i++)
      cout << p[i] << ' ';
   cout << endl;
}