搜索资源列表
经典约瑟夫环问题c语言版
- 数据结构中解决约瑟夫环问题的代码，里面只有源代码，大家用TC2编译一下就可以用了：）。-data structure to solve the problem of Josephus code, only the source code, we use TC2 compiler can use it with a :).
Mase
- 用VC写的，用栈解决了数据结构基本的迷宫问题.没有用到MFC类库-VC wrote, with a stack data structure to solve the basic problem of the maze. Do not use MFC
用分枝定界法求解TSP
- 分支定界法可以求解小规模的TSP问题,这个例子是用vc编写的-branch and bound method can solve small-scale TSP, this example was prepared by the vc
全排列
- 多种方法解决全排列的问题 在vb环境下编写-various methods to solve all problems with the environment in preparation vb
近邻算法求解TSP问题
- 本程序用另外一种算法即近邻算法解决ＴＳＰ，即旅行商问题，请高手指教．-this procedure with the other algorithms that solve the TSP neighbor algorithm, the traveling salesman problem, experts advise.
求一个Dijkstra优化算法
- 求解一个最短路径问题程序，可以参考一下求一个Dijkstra优化算法！ 谢谢了 目的是求给定两点之间的最短距离 或者改一下我的程序也行 -shortest path to solve a problem of procedure, can seek a reference Dijkstra algorithm optimization! Thank you, the purpose is scheduled for 2:00 to the shortest distance be
背包算法
- 高级算法中的背包问题求解，算法简便高效，主要解决动态规划0-1背包问题-senior algorithm to solve the knapsack problem, the algorithm is simple and efficient, dynamic programming solution 0-1 knapsack problem
贪婪算法解决背包
- 运用贪婪算法能够很好解决0/1背包问题，这是我编的一个小程序，运行过很好。-greedy algorithm can be used to solve a very good 0 / 1 knapsack problem, this is my part of a small program running very good.
最短路径的求解
- 本实验中的问题是一个逻辑问题，而实验的目的是运用邻接矩阵解决图存储并解决在此结构情况下对矩阵中元素的扫描计算。其关键是怎样储存和计算。储存用的是邻接矩阵，而计算是用迪杰斯特拉算法。-experiment of the problem is a problem of logic, and The purpose of this experiment is to use the adjacency matrix storage solutions and plans to solve the st
四种差分方法求微分方程
- 差分法求解微分方程：古典显式法,收敛性最差；古典隐式法；Crank-Nicolson法,收敛性最好-difference method to solve the differential equation : Explicit classical method, the worst convergence; Classical implicit; Crank-Nicolson, the best convergence
漫步迷宫
- 本程序采用C开发，寝室迷宫算法的最短路径求解。-the procedures used C development, dormitory maze of the shortest path algorithm to solve.
kmpEx
- KMP算法是字符串模式匹配算法， 解决DBCS字符集的问题。-KMP algorithm is a string pattern matching algorithms, DBCS characters to solve the problem,.
accepted1
- 解决时钟问题，acm竞赛题 A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you cannot use any other kind.
main
- 在现代的企业管理中，火车管理系统有着重要作用。由于现代的竞争力的加强，讲究效率，不管是时间、还是地点，两地的生意常常因为距离而无法得到理想的解决。火车作为一个传统的交通工具，需要进行改革。由于订票、退票常常给乘客带来一定的麻烦，因此作为一个火车管理系统解决了这个问题。它方便乘客最快地订到自己想要的票也同时解决了退票的问题。-in modern enterprise management, train management system plays an important role. Conte
xiongyali
- 匈牙利算法,求解二分图最大匹配的一个时间复杂度与程序复杂度折中的算法-Hungary algorithm to solve the greatest two minutes map matching a time complexity and the complexity of program compromise Algorithm
fjdjf
- 用分支界限法解决的几个问题:包括0-1背包问题,最大团问题,电路布线问题,最大装载问题.作业最优处理问韪.-branch line with the law to solve several problems : including 0-1 knapsack problem, the largest group, circuit wiring problem, the greatest problem loading. Optimal handling operations Q premises
8
- 用A*启发式算法解决八数码问题,用纯C实现-using A* algorithm to solve Eight-puzzle
How-to-Solve-It
- 经典算法入门书籍，适合各种需要算法入门人了解比较常见的算法-Classical algorithm introductory book, suitable for all kinds of people need to understand the more common algorithms start the algorithm
To-solve-the-equation-solution
- 使用二分法不断循环，一直到误差很小。求近似解未知方程的零点-To solve the equation
ts-solve-0-1-knapsack-a-info
- 用禁忌搜索解决0-1背包问题，及一些关于禁忌搜索优化和并行处理的资料-Tabu search to solve 0-1 knapsack problem, and some information on tabu search optimization and parallel processing of data