dfx和bfs算法

c语言常用算法程序集-c language commonly used algorithm Set

This OpenNL, a library to easily construct and solve sparse linear systems. * OpenNL is supplied with a set of built-in iterative solvers (Conjugate gradient,BICGSTAB, GMRes) and preconditioners (Jacobi, SSOR). * OpenNL can also use other solvers (SuperLU 3.0 is supported as an OpenNL extension,MUMPS will be supported in a future version)-This is OpenNL. a library to easily construct and solve sparse l inear systems.* OpenNL is supplied with a set of built-in iterative solvers (Conjugate gradie nt, Application of BICGSTAB. GMRes) and preconditioners (Jacobi, SSOR).* OpenNL can also use other solvers (Super rLU 3.0 is supported as an OpenNL extension, MUMPS will be supported in a future version)

梯度下降法，需要安装numpy库，示例是二位的点进行拟合。将注释去掉就可以完整运行。根据网上的梯度下降算法公式编写完成。可以自己扩展到多维的数据点进行拟合

本算法主要针对声卡的声压进行测量并换算成相应的声压级，如A计权，B计权，可以直接在Matlab中进行调用计算

蚁群算法对机械臂的路径进行仿真规划，可以利用蚁群算法进行机械臂的路径进行规划，如果需要，请下载……………………

使用TMS320F2812实验三相交流异步电机调速的程序，通过此代码可以学习DSP2812的编程框架和SPWM的产生方法。程序代码全部为C/C++语言-TMS320F2812 experiments using three-phase AC induction motor of the process, through this code can learn DSP2812 programming framework and method for the selection of SPWM. Code all C/C++ Language

杭州电子科技大学在线系统ACM的1102题，用贪心方法解决-Hangzhou University of Electronic Science and Technology ACM-line system of the 1102 title with a greedy solution

此程序读取一个文件从一个国家的城市之间的距离的名字"图"，然后从输入获取的两个城市的名称。然后它计算两个城市的最短的路径。输出是路线和最短路径。 "图"文件的结构就像： 源城市目的地城市的距离。 NONAME00.cpp 创建文件"graph.dat"。

用一观测器从t=1秒开始对一个运动目标的距离进行连续地跟踪测量，假设观测的间隔为一秒钟，雷达到运动目标之间的距离为S(t)（1） 统计特性的初值为 （2）观测误差是与和均不相关的白噪声序列，并且有 （3）观测数据存放在附加的文件中（单位：m）。 要求：分析上述对象，建立系统模型，构造卡尔曼滤波器，编程计算，求： （1） 距离S(t)的最佳估计及估计误差， （2） 距离S(t-5)的最佳平滑及估计误差， （3） 距离S(t+5)的最佳预测及估计误差， （4） 对结果进行分析讨论。 -By one observer from the t = 1 PST on a moving target tracking for distance measurement, assuming that the observation interval is one second, the radar that the distance between the moving target for the S (t) (1) the statistical characteristics of the initial condition (2) observational error is not associated with white noise sequence, and (3) observational data stored in the attached document (unit: m). Requirements: Analysis of the above-mentioned object, the establishment of the system model, constructed Kalman filter, programming terms, seeking: (1) distance from S (t) the best estimate and the estimation error, (2) distance from S (t-5) the most good smoothing and estimation error, (3) distance from S (t+ 5) t

研究生期间上《数值计算方法》课的作业，所有代码都是C语言实现并调试通过，现在上传为大家服务。这是Doolittle分解的算法-"numerical methods" courses of operations, are all code and the C language debugging passed, and upload to us. Try This is the decomposition algorithm