资源列表
Text2
- 二维位势问题的边界元程序。常数不连续元，fortran77编制-2D potential BEM
Ordinary-Differential-Equations
- 求解常微分方程组，用了四种方法，分别是：先前欧拉、向后欧拉、改进欧拉、RK4方法。-Solution of ordinary differential equations, using the four methods are: the previous Euler, Backward Euler, Improved Euler, RK4 method.
PC-ANSR
- English user manual of ANSR-1-user manual of ANSR-1
DRAIN-2DX-UIUC
- souce code of programe DRAIN-2DX-UIUC
www
- 很好的，其实这是我自己做的东西，希望大家好好看看啊啊！-Well, actually this is what I do, I hope you take a look at ah!
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.