Search - backtrack--TSP

Search - backtrack--TSP - List

[Other resource] backtrack--TSP DL : 0: 使用回溯法求解TSP问题，使用VC++编写。代码量挺少，不过数据较大的时候需要时间比较长，时间复杂度为O(n!)
Update : 2008-10-13 Size : 5.28kb Publisher : 太阳
[AI-NN-PR] backtrack--TSP DL : 0: 使用回溯法求解TSP问题，使用VC++编写。代码量挺少，不过数据较大的时候需要时间比较长，时间复杂度为O(n!)-Use backtracking to solve TSP problems, the use of VC++ Prepared. Code volume quite low, but when the need for greater data a longer period of time complexity is O (n!)
Update : 2025-02-16 Size : 5kb Publisher : 太阳
[Mathimatics-Numerical algorithms] TSPandBAGproblem DL : 0: 包里包含五个文件，其中ASforTSP是用蚂蚁算法解决TSP问题，Backtrack是用回溯法解决01背包问题，GAO是用遗传算法解决TSP，GreedySelector是用贪心算法解决01背包问题，MoneyChange是金额的数字与汉字的转换方案，本人作为一个学生初学编程，希望多多包涵。-Package contains five files, which ASforTSP ant algorithm to solve TSP is the problem, Backtrack 01 is backtracking to solve knapsack problem, GAO is to use genetic algorithm to solve TSP, GreedySelector 01 is greedy algorithm to solve knapsack problem, MoneyChange is the amount of digital with the Chinese characters conversion programs, I as a beginner programming students, I hope bear with me.
Update : 2025-02-16 Size : 10kb Publisher : 梦幻