资源列表
IFS
- 迭代加深搜索，实质上是限定下界的深度优先搜索。即首先允许深度优先搜索K层，若没有发现可行解，再将K+1后 重复以上步骤搜索，直到搜索到可行解。-Iterative Deepening Search
greedy-algorithm
- 贪婪算法从文件输入一个高精度正整数N，去掉其中任意S个数后剩下的数字按原左右次序将组成一个新的正整数。编程对给定的N和S，寻找一种方案使得剩下的数字组成最小的新数。 输出得到的新正整数 -greedy algorithmEnter a high precision the file is an integer N, remove any of the number of S after the number of the left and right in order to form
QuikSort
- 数据结构与算法导论实验课的实验，实现快速排序-Data Structures and Algorithms Introduction to experiment course experiments, fast sorting
Buiness
- 采用回溯法解决经典的商人过河问题，特色是可以让用户随意设定商人和仆人的数量（商人数大于仆人数）。-Use backtracking to solve the classic businessman river issues, This program allows users to freely set the number of merchants and servants (trade number is greater than the number of servant).
kspxdfcz
- 数据结构，快速排序算法，快速排序并对分查找-Fast sorting algorithm Quicksort and binary search
jisuanchurudu
- 数据结构，cyuyan 计算数组的出度和入度。-Data structures, arrays calculate the degree and in-degree.
HaffumanCode
- 根据赫夫曼算法求赫夫曼树，根据赫夫曼树求赫夫曼编码-According to Huffman tree Huffman coding requirements
prim
- 普里姆（Prim）算法是一种构造性算法。用于求最小生成树。-Prim algorithm is used for solving the minimum spanning tree.
Kruskal
- kruskal算法是一种求加权连通图的最小生成树的算法。-kruskal algorithm is a weighted connected graph minimum spanning tree algorithm.
DijkstraPath
- Dijkstra算法是由E.W.Dijkstra于1959年提出,又叫迪杰斯特拉算法,它应用了贪心算法模式,是目前公认的最好的求解最短路径的方法。-Dijkstra algorithm greedy algorithm mode, is widely recognized as the best method for solving the shortest path.
criticalpath
- 关键路径法(CPM)是一种用来预测总体项目历时的项目网络分析工具-Critical Path Method (CPM) is a program used to predict the overall duration of the project network analysis tools
DFA--TO--NFA--simpleDFA
- 程序实现的是编译原理中的NFA到DFA的转换（使用子集构造法）。以及使用等价划分算法实现的DFA的简化-Realize the principle is to compile the NFA to DFA conversion (using the subset construction). As well as simplify the use of equivalence partitioning algorithm to achieve the DFA