搜索资源列表
Binary_Tree
- 根据二叉树的抽象数据类型的定义，使用二叉链表实现一个二叉树。 二叉树的基本功能： 1、二叉树的建立 2、前序遍历二叉树 3、中序遍历二叉树 4、后序遍历二叉树 5、按层序遍历二叉树 6、求二叉树的深度 7、求指定结点到根的路径 8、二叉树的销毁 -According to the abstract data type binary definition, use two forks to implement a binary tree
FP
- Numerical Methods- computes for root by fixed-point iteration . :)
graph
- 数据结构——图的基本结构 求给定图中的边（或弧）的数目。 求解出从给定顶点到所有顶点的最短路径（以边数计算）。 判断一个有向图g是否是一棵有向树。（任意一个顶点可能是根） 对给定的图G及出发点，设计算法从出发深度遍历图G，并构造出相应的生成树。 -Data structure- that the basic structure of the given graph edge (or arc) number. Solving out from a given vertex to a
qiugen
- 用弦截法实现求方程的根，并且利用c++实现，计算精度高 -Secant Method used to achieve the root of equation, and using c++ to achieve high precision
SolveQuadricEquationWithOneUnknown
- 在控制台模式下，输入一元二次方程的系数，结果输出为方程的根-input：quotients of equation output:the root of equation
erfenfa
- 利用二分法求解方程的根，使用C++编程实现的，程序很简单，但也很实用的，希望大家多多支持-Solving equations using the root of the dichotomy, the use of C++ programming, the procedure is very simple, but is also very useful, hope you can enjoy
dutchroll
- dutch roll root locus for aircraft using matlab
Pitch_ori_high_alpha
- root locus pitch orientation for high angle of attack using matlab
Glide_slope
- root locus of glide slope using matlab
dsp5
- 求数字1到10000的原根，返回原根值，若无原根显示说明-Find the numbers 1 through 10,000 of the original root, return the root value, in the absence of the original descr iption of the root shows
testrc
- 套用公式 计算电阻电容的值 I1 = U / R + j2πfCU I2 = U / R + Kj2πfCU IR = U / R = (（K^2 *I1^2-I2^2）/(K^2-1))开根号 C=(I2-I1)/(4Pi*U)-Apply the formula to calculate the value of resistance and capacitance I1 = U/R+ j2πfCU I2 = U/R+ Kj2πfCU IR = U/R =
shuzhifenxi
- 里面是例题，Gauss消元法，Gauss列主元消元法，平方根法，追赶法，SOR法求方程组的根-There are examples, Gauss elimination method, Gauss elimination method pivot column, the square root law, pursuit method, SOR Method root equations
bisecty
- Demonstration of Bisection Root Finding of a functiony
falspos
- Demonstration of Root Finding using False Position
incsrch
- root finding by incremental search
newtraph
- Newton-Raphson root finding - single function
secant
- Root finding using Secant method
iterativemethods
- 分别用二分法、Newton法、弦截法、Newton下山法四种迭代法求解非线性方程x5-3x3+x-1= 0 在区间[-8,8〕上的全部实根，设计算法完成根区间隔离，然后实现单根区间上的迭代算法求解方程。-Respectively dichotomy, Newton method, Secant Method, Newton descent method four kinds of iterative methods for solving nonlinear equation x5-3x3+ x
proj1_1
- 求小于等于n 的所有的素数，算法时间复杂度为O（根号下n）-Less than or equal n, find all the prime numbers, the algorithm time complexity is O (square root of the next n)
migong
- 随机地图的迷宫，*号表示走过的路径,#表示墙，@表示回溯=表示未走但可走的地方，原始地图只含有=和#信息-maze for root in various random maps