穷举法解决旅行商问题

  1 using System;
  2 using System.Collections.Generic;
  3 using System.Linq;
  4 using System.Text;
  5 using System.Threading.Tasks;
  6 
  7 namespace 旅行商问题
  8 {
  9     class Program
 10     {
 11         static void Main(string[] args)
 12         {
 13             //权值矩阵
 14             int[,] weightValue = new int[10, 10];
 15             //城市数量
 16             int cityNum = 0;
 17             //城市名称
 18             string[] cityName = new string[10];
 19             //出发城市 用索引表示
 20             int beginCityIndex = 0;
 21             //权值
 22             int minWeightValue = int.MaxValue;
 23             int weightSum = minWeightValue;
 24             //最佳路径
 25             int[] bestWay;
 26 
 27             //输入城市数量
 28             Console.WriteLine("请输入城市数量:");
 29             cityNum = int.Parse(Console.ReadLine());
 30             Console.WriteLine("请输入各个城市名称");
 31             for (int i = 0; i < cityNum; i++)
 32             {
 33                 cityName[i] = Console.ReadLine();
 34             }
 35             Console.WriteLine("请输入权值矩阵：");
 36             //输入权值矩阵
 37             for (int i = 0; i < cityNum; i++)
 38             {
 39                 for (int j = 0; j < cityNum; j++)
 40                 {
 41                     weightValue[i, j] = int.Parse(Console.ReadLine());
 42                 }
 43             }
 44             //输入出发城市
 45             Console.WriteLine("请输入出发城市：");
 46             beginCityIndex = int.Parse(Console.ReadLine());
 47 
 48             bestWay = new int[cityNum+1];
 49 
 50             for (int i = 0; i < cityNum; i++)
 51             {
 52                 if (i != beginCityIndex)
 53                 {
 54                     for (int j = 0; j < cityNum; j++)
 55                     {
 56                         if (j != i && j != beginCityIndex)
 57                         {
 58                             for (int k = 0; k < cityNum; k++)
 59                             {
 60                                 if(k!=j && k!=i && k!=beginCityIndex)
 61                                 {
 62                                     for (int t = 0; t < cityNum; t++)
 63                                     {
 64                                         if(t!=i && t!=j && t!=k && t!=beginCityIndex)
 65                                         {
 66                                             weightSum = weightValue[beginCityIndex,i]
 67                                                 +weightValue[i,j]
 68                                                 +weightValue[j,k]
 69                                                 +weightValue[k,t]
 70                                                 +weightValue[t,beginCityIndex];
 71                                             if(minWeightValue>weightSum)
 72                                             {
 73                                                 minWeightValue=weightSum;
 74                                                 bestWay[0] = beginCityIndex;
 75                                                 bestWay[1] = i;
 76                                                 bestWay[2] = j;
 77                                                 bestWay[3] = k;
 78                                                 bestWay[4] = t;
 79                                                 bestWay[5] = beginCityIndex;
 80                                             }
 81                                         }
 82                                     }
 83                                 }
 84                             }
 85                         }
 86                     }
 87                 }
 88             }
 89 
 90 
 91             Console.WriteLine("最短路径为：");
 92             Console.WriteLine(cityName[bestWay[0]]+"->"
 93                              + cityName[bestWay[1]] + "->"
 94                              + cityName[bestWay[2]] + "->"
 95                              + cityName[bestWay[3]] + "->"
 96                              + cityName[bestWay[4]] + "->"
 97                              + cityName[bestWay[5]]);
 98 
 99             Console.WriteLine("最小权值为{0}", minWeightValue);
100 
101             Console.ReadKey();
102         }
103     }
104 }