资源列表
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
TraverTrain
- 折半查找快速排序、二叉排序树、堆排序检索策略在列车信息检索中的应用-Quicksort binary search, binary tree sort, heap sort search strategy used in train Information Retri
maze-
- 设计一个8*8矩阵用来表示迷宫，针对这个矩阵，程序判断是否能够从起点（右上角）经过迷宫走到终点（左下角）。-Design a 8*8 matrix to represent the maze, for this matrix, the program can determine whether the starting point ( the upper right corner) through the maze to the end point (bottom left).
Voronoi
- 采用中垂线构图的方式解决Voronoi构图问题，本算法随机生成外部凸包，可以高效解决内部节点个数为20以下的Voronoi构图，并且用graphics.h画出相应图形。-Using the vertical resolution of Voronoi patterned patterning problem, the algorithm randomly generated outside the convex hull can efficiently solve the number of i
Comparison-of-sorting-algorithms
- 比较8种排序算法的时间：直接插入排序、希尔排序、冒泡排序、快速排序、选择排序、堆排序、归并排序、基数排序- Comparative eight algorithm time: direct insertion sort, Hill sort, bubble sort, quick sort, select, sort, heap sort, merge sort, radix sort
Arithmetic-expression-evaluator
- （1） 从键盘或文件读入一个合法的算术表达式，输出正确的结果。 （2） 显示输入序列和栈的变化过程。 （3） 考虑算法的健壮性，当表达式错误时，要给出错误原因的提示。-(1) the keyboard or the file is read into a legitimate arithmetic expressions, output the correct result. (2) changes in the sequence and displays the input pr
Queen
- 皇后问题，自定义输入N，完成N*N棋盘的N皇后排列问题。-Queens, custom input N, N Queen permutation problem N* N chessboard.