▍1. tree
设T 是一棵带权树,树的每一条边带一个正权。又设S 是T 的顶点集,T/S 是从树T 中 将S中顶点删去后得到的森林。如果T/S中所有树的从根到叶的路长都不超过d ,则称T/S 是一个d 森林。(this is a project )
设T 是一棵带权树,树的每一条边带一个正权。又设S 是T 的顶点集,T/S 是从树T 中 将S中顶点删去后得到的森林。如果T/S中所有树的从根到叶的路长都不超过d ,则称T/S 是一个d 森林。(this is a project )
三次样条插值公式C语言编程示例(Cubic spline interpolation formula C language programming examples)
求二元一次方程组的解,简便算法的过程及计算(Solving linear equations group,Process and simple calculation algorithm)
最小二乘法数据处理软件,翻遍计算的程序,应用于各种优化算法(math caculateor)
最小二乘法数据处理软件,翻遍计算的程序,应用于各种优化算法(math caculateor)
计算力学基础,中国科技大学精品教材,王秀喜,吴恒安编著(The basis of Computational Mechanics, University of Science and Technology of China, boutique textbook series)
The only information passed from difeq to solvde is the matrix of derivatives
C/C++写的求小于N的素数,速求,求效率,适合大家看看。(count any numbers less than a order number by c/c++,very quickly,you can learn someting from it.)
求解实系数方程组的高斯消去法,约当法,追赶法,分解法,平方根法,大型稀疏方程组法(Solving real coefficient equations of the main Gaussian elimination, about the law to catch up with France, large-scale sparse equations.)
homagrapy matrix to find the homagrapy matrix from two pictures, first you need to get a set of coorlation vector
hartigans Sequential Leader Clustering Algorithm in terms of OpenCV (ver.1.1) Sequential Leader algorithm: Hartigan, J. A. (1975), Clustering Algorithms. John Wiley and Sons, Inc., New York, NY. 1. Select maximum cluster "radius" 2. Start with zero clusters 3. Add each item to be clustered to: * Closest cluster if distance <= r * New cluster if distance to closest cluster > r 4. Compute new center from members in cluster 5. Empty the clusters (keeping the centers) 6. Return to step 3 (until no changes are made)
Algo2-2.c C program for implementing Algorithm 2.2 Algorithm translated to C by: Dr. Norman Fahrer IBM and Macintosh verification by: Daniel Mathews NUMERICAL METHODS: C Programs, (c) John H. Mathews 1995 To accompany the text: NUMERICAL METHODS for Mathematics, Science and Engineering, 2nd Ed, 1992 Prentice Hall, Englewood Cliffs, New Jersey, 07632, U.S.A. Prentice Hall, Inc. USA, Canada, Mexico ISBN 0-13-624990-6 Prentice Hall, International Editions: ISBN 0-13-625047-5 This free software is compliments of the author. E-mail address: in "mathews@fullerton.edu" Algorithm 2.2 (Bisection Method). Section 2.2, Bracketing Methods for Locating a Root, Page 61
Hypercomplex mathematical morphology
多项式的链表存储表示以及实现多项式的加法(Said polynomial storage list and the realization of polynomial addition)
這個程式可以顯示 3~100 的 prime number,很適合新手練習的範例程式,附上源碼可以修改內部細節,多做驗證。()
说明: 二阶曲线拟合,最小二乘法,此程序是在c++ builder6.0环境下开发的(second curve fitting, least squares method, this procedure is in c builder6.0 development of the environment)
说明: 模糊指数平滑算法源程序,进行预测 计算.(fuzzy exponential smoothing algorithm source for projection.)
用C++Builder实现的银行家算法可以任意 输入进程个数各类资源的个数输出安全序列(with C++ Builder bankers algorithm can process arbitrary importation of all types of resources the number of security Sequence Number output)