BP1

旅行商问题(TravelingSalesmanProblem，TSP)是一个经典的组合优化问题。经典的TSP可以描述为：一个商品推销员要去若干个城市推销商品，该推销员从一个城市出发，需要经过所有城市后，回到出发地。应如何选择行进路线，以使总的行程最短。从图论的角度来看，该问题实质是在一个带权完全无向图中，找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列，随着顶点数的增加，会产生组合爆炸，它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)

程序目的： 输入一个任意大小的迷宫，用栈求出一条走出迷宫的路径，并 显示在屏幕上。 程序实现： 可以实现载入迷宫和保存迷宫，附带文件中有4个测试迷宫路径的 文件test1~4.dd。请将这些文件拷贝到TC当前目录下，或者在载 入时写明完全路径。由于屏幕大小的限制，当用户自己输入迷宫 时一定要注意：迷宫大小是有限制的，不小于4*3,不大于30*20。 否则会出现错误信息。输入开始时全是墙，用上下左右键移动， 用Del键删除墙，形成通路，用Enter键添加墙。输入结束时可以 将迷宫保存下来，以dd为扩展名。输入完毕时用F9键来得到结果， 找到路径时，屏幕下方会出现Path found，否则出现Path not found。 程序经Turbo C 2.0编译调试成功。运行时不用添加任何运行库。 不可以在VC上编译。-procedures purpose : to bring in a maze of arbitrary size, with a stack get out of the maze of trails and on the screen. Program : can achieve and preserve the printed maze maze, the accompanying documents were four test maze of trails to document test1 4.dd. I would be grateful if those files are copied to the TC current directory, or in the state when fully contained path. Due to restrictions on the size of the screen when the user input labyrinth must pay attention to : the size of the maze is a restriction, not less than 4* 3, not more than 30* 20. Otherwise there will be a wrong message. At the beginning of the importation of a

针对复合材料层合板的非线性振动系统数值分析MATLAB代码分析(Stitching Composite Material Layered Non - Linear Ballistic System Integrity Value Analysis MATLAB Alternative Analysis)

题目：从键盘输入一些字符，逐个把它们送到磁盘上去，直到输入一个#为止。(Title: enter some characters from the keyboard, and one by one they go to the disk until the input a#.)

dbf中的lcmv算法，对应于《一种低旁瓣数字波束形成方法》中的面阵仿真(dbf in lcmv algorithm plane array corresponding to a low sidelobe digital beamforming method " Simulation)

一个漂亮的日记本，记录个人每日的心情，和每日的情况-A beautiful diaries, records of individual daily mood, and daily situation

kaba key 2009 kaba key 2009

用C语言写的比赛管理系统，内附课程设计的完整材料。(Using C language to write the game management system, curriculum design included the complete material.)

拼写检查-Spelling Checker

精美系统图标-Fine system icon