资源列表
Kruskal
- 约瑟夫环问题，此源码是对约瑟夫环问题使用链表进行实现的。
yangtiaochazhi
- 该程序能实现第一型三次样条插值，边界条件是端点的一阶导数。结果可以同时显示每段区间的插值多项式。
beibao
- 背包问题，可以解决最短路径问题，或优化问题-Knapsack problem, the shortest path problem can be solved, or optimization problems
QiuZhi
- 表达式求值,输入一个表达式,支持括号运算, 还很不完美,仅能计算较简单的表达式.-Expression evaluation, enter a regular expression to support the operator in brackets, but also far from perfection, only the expression of relatively simple calculation.
liantongtu
- 给定n个结点的有向图的邻接矩阵，可判断该图是否为强连通的，单向连通的，或弱连通的。-For a given n-node directed graph adjacency matrix, can determine whether the plan strongly connected, and one-way connected, or weak connectivity.
shiyan_4_2
- 实现迷宫中寻找路径的相关算法，运用堆栈的方法解决例如迷宫老鼠问题-The maze to find the path to achieve the correlation algorithm, using the stack means to solve the problems such as the rat maze
erchashu
- 数据结构中，二叉树程序！包括中序，前序，后序查询-Data structure, binary tree program! Included in the order, preorder, postorder query! ! !
exam-7-8-9
- 关于数据结构这门学科的源代码程序，序列七之七、八、九。-About data structure of the subject, the source program
duilie
- 完成对循环队列结构的定义，以及对循环队列的各种基本运算的实现（每种基本运算用一个函数来实现）。 -Completion of the circular queue structure is defined, and the circular queue implementation of various basic operations (each basic operations to implement a function).
SegTree(with-lazy-tag)-POJ3468
- 自己写的线段树，带LAZYTAG的-The SegmentLineTree worte by myself,with LazyTag
hugh
- 霍夫变换的基于matlab的源程序代码，3个参数输入，8个参数输出-Hough transform based on Matlab source code
canny_test
- canny算子边缘检测，和传统的边缘检测算子相比，Canny 算子具备更好的检测效果。-canny egde detection