登录
首页 » matlab » dijstra

dijstra

于 2010-04-30 发布 文件大小:9KB
0 135
下载积分: 1 下载次数: 0

代码说明:

说明:  MATLAB的dijstra算法,MATLAB的dijstra算法(MATLAB s dijstra algorithm)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论


0 个回复

  • motionEstAnalysis
    block searching algorithm.block searching algorithm.block searching algorithm.block searching algorithm.block searching algorithm.block searching algorithm.block searching algorithm.block searching algorithm.block searching algorithm.block searching algorithm.v
    2010-08-05 20:23:23下载
    积分:1
  • MagicBox
    Magic number.. This programme can guess your decided number, by VB simple programme.
    2009-03-17 21:31:02下载
    积分:1
  • nol-local
    说明:  一种有效的滤波算法,通过比较特定区域内的像素点的邻域均值来进行图像的去噪滤波。(An effective filtering algorithm, by comparing the particular pixel within the region to the neighborhood mean filter for image denoising.)
    2010-04-28 11:38:04下载
    积分:1
  • QtMatlab
    一个简单的Matlab与Qt结合的项目。(A simple combination of Matlab and Qt project.)
    2013-08-19 15:45:50下载
    积分:1
  • Decoupling-control-requirements-u
    解耦控制要求下的极点配置Matlab算法(Decoupling control requirements under the pole placement Matlab algorithm)
    2013-09-02 08:59:05下载
    积分:1
  • my matlab2
    用帧差法实现视频内运动物体的捕捉与检测,可自行添加视频文件(Using Frame Difference Method to Realize the Capture of Moving Objects in Video)
    2017-09-27 08:57:08下载
    积分:1
  • danchunxingfa
    单纯形法,求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是:线性规划问题的可行域是 n维向量空间Rn中的多面凸集,其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是:先找出一个基本可行解,对它进行鉴别,看是否是最优解;若不是,则按照一定法则转换到另一改进的基本可行解,再鉴别;若仍不是,则再转换,按此重复进行。因基本可行解的个数有限,故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination. )
    2011-01-17 21:01:44下载
    积分:1
  • lms
    说明:  反正切函数的变步长算法,能实现反正切函数的变步长的仿真!(Arc tangent function, variable step-size algorithm)
    2010-03-31 10:50:11下载
    积分:1
  • mimomo
    its a matlab program ~~~~~ you can do tit
    2012-04-30 15:59:32下载
    积分:1
  • MATLAB-
    这里面有MATLAB常用的一些算法,用于计算数值计算,文件格式为.m(There MATLAB commonly used in some algorithms used to calculate the numerical calculation for the file format. M)
    2012-06-09 17:39:21下载
    积分:1
  • 696518资源总数
  • 105289会员总数
  • 8今日下载