资源列表
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
linear-tables
- 理解和掌握线性表的链式存储结构的C语言描述；学会单链表的插入与删除运算的算法。-Understand and master the linear form of the chain storage structure of the C language descr iption learn single linked list insertion and deletion algorithm.
FundamentalsLab
- basic ai fundamentals queue list data structures lab project tree traversal depth-first pre-order depth-first post-order breadth-first traversal linked list data structure queueing behavior sequence and selector behavior for AI agent tree functionali
toeplitz
- 附件中有数理统计的相关课件一章，并有toeplitz矩阵的一些经典分解和处理方法-Annex several statistics related courseware chapter, and there are some classic decomposition and matrix processing method toeplitz