资源列表
astar
- Astar algorithm using simple method to code it
Active-Contours
- This programme gives much useful in image processing
DFS
- Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking.
BFS
- In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds
Countingsort
- Counting sort (ultra sort or math sort[1]) is a sorting algorithm which (like bucket sort) takes advantage of knowing the range of the numbers in the array to be sorted (array A). It uses this range to create an array C of this length.
zadania3_3_Dijkstry
- Dijkstra s algorithm. The program searches for the shortest rail link between towns.
jisuanqi
- 简单计算器的计算器，用c#运行，希望有用-Calculator simple calculator, with c# run.
matrix-inversion
- 矩阵求逆的完整实现，其中包括矩阵转置、求矩阵行列式、求伴随矩阵等功能模块，可以直接使用。-Complete implementation of matrix inversion, including matrix transpose, a matrix determinant, matrix and other requirements associated with function modules can be used directly.
Rand
- 原创，一个实用的算法，生成小范围，但比较大的整型随机数。-Original, a practical algorithm to generate small, but large integer random number.
linear-equations
- 求解线性方程组 通过逼近方法逐渐取得线性方程组的解。-Solving linear equations obtained by approximation method for the gradual solution of linear equations.
eigenvalue
- 求解矩阵的特征值 采用数学上的逼近方法求解-By solving the eigenvalue approximation method for solving the mathematical
nonlinear-equation
- 非线性方程求解 简单的求解非线性方程根的程序-Simple linear equation the procedure for solving nonlinear equation root