搜索资源列表
wtsf.tgz
- N皇后问题回溯算法.c 货郎担分枝限界图形演示.c 矩阵乘法动态规划.c 万年历 动态计算网络最长最短路线.c 货郎担限界算法.c 骑士遍历 网络最短路径Dijkstra算法.c-N queens problem backtracking algorithm. C TSP branch and bound graphical presentation. C matrix multiplication, dynamic program
fasterjob
- 货郎担寻找最短路径的问题的正确解答答案算法-Traveling salesman problem to find the shortest path algorithm for the correct answers to the answer
tsp
- 用A*算法解决货郎担（旅行商）tsp问题，用文件读去，文件中需在第一行有数字n，然后再在后面n行输入n*n的数字矩阵，即可得出结果-A*
problem-solving
- 各种问题算法，包括，N皇后问题回溯算法，动态计算网络最长最短路线，货郎担界限，矩阵乘法动态规划等-Algorithm for various problems, including, N Queens problem backtracking algorithm, dynamic network of the longest shortest path computation, Traveling Salesman boundaries
algorithm
- 各种经典问题的求解方法，如N皇后问题回溯算法，动态计算网络最长最短路线，货郎担限界算法，网络最短路径Dijkstra算法-All kinds of classic problem solving methods, such as N queen problem back in the algorithm, the dynamic calculation longest shortest route network, HuoLangDan
some-problems
- 一些实际的问题处理算法，例如网络最短路径Dijkstra算法、货郎担限界算法等-Some practical problems processing algorithms, such as Dijkstra Shortest Path algorithm, traveling salesman Bound algorithm
Astar-to-solve-TSP
- A* 算法的一个应用，货郎担（旅行商）问题。设有n个城市，城市之间均有道路，一个旅行商从某城市出发，经过其余n-1个城市一次且仅一次，最后回到出发的城市，他如何走才能使他所走的路程最短？-Traveling salesman problem and the optimal solution