资源列表
Nqueens
- 求解N皇后的问题，希望提出宝贵的意见，共同进步-Solving the N-Queens problem, I hope for their valuable comments
Symbol-triangle
- 符号三角形问题，共同学习研究，有不足之处还请指出-Symbol triangle problem, common study, also requested the inadequacies pointed out
1
- 猴子选大王是数据结构中关于链表的一个经典的算法问题，比较实用，用C++实现-The monkey king election is the algorithm on a classic linked list data structure, more practical C++ to achieve
Backtracking
- 回溯法，根据解空间树的结构，判断出结果集，不足之处还请指出-Backtracking, according to the tree structure of the solution space, determine the result set, inadequacies also please indicate
Optimal-scheduling
- 最佳调度，算法分析中很重要的一种处理方法，通过比较最终数值大小，得出结果-Best scheduling algorithm analysis an approach by comparing the final value of the size, the results
Best-service-order
- 思路是最短服务时间优先，先将服务时间排序，然后注意后面的等待服务时间既包括等待部分，也包括服务部分。-The idea is shortest service time priority, first service time Sort, then pay attention to the back of the waiting time both waiting for the part, and also includes the services section.
calacomplie
- 设计多个类，实现整数算术表达式的翻译与计算，其中包括： 1. 识别输入字符串中的整数和各种运算符号 2. 判断输入字符串是否满足整数算术表达式的语法规则 3. 对满足语法规则的字符串，采用递归下降分析法、LL（1）分析法、优先分析法或LR分析法，建立输入字符串的语法树 4. 根据语法树，将输入字符串翻译成中间的四元式代码表示 5. 根据四元式代码，计算整个表达式的值并输出 6. 设计合理的输入、输出界面-A program to calculate the result
GA_TSP2
- 基于遗传算法的TSP问题实现 本程序是利用MFC编程,通过读入文件信息计算得出最佳路径.并可视化了路程的路线.-Solving Travel salesman problem using genetic algorithm
IJIGSP-V3-N3-2
- Active contours or \snakes" can be used to segment objects automatically. The basic idea is the evolution of a curve, or curves subject to constraints from the input data. The curve should evolve until its boundary segments the object of intere
Exercise-1
- Understanding a Secret Message You have just intercepted an encoded message.
FW
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。该算法名称以创始人之一、1978年图灵奖获得者、斯坦福大学计算机科学系教授罗伯特·弗洛伊德命名。-Floyd algorithm, also known as Freud algorithm, the insertion point method is an algorithm used to find the shortest path between vertices given weighted g
Floyd-Warshall
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法-Floyd algorithm, also known as Freud algorithm, the insertion point method is an algorithm used to find the shortest path between vertices given weighted graph. The algorithm name to one of the founders,