登录
首页 » matlab » mintree

mintree

于 2009-05-30 发布 文件大小:1KB
0 349
下载积分: 1 下载次数: 7

代码说明:

  用matlab去实现基于dijkstra算法实现最小生成树(Using matlab to dijkstra algorithm based on minimum spanning tree)

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

发表评论

0 个回复

  • zhang
    自编matlab的张正友标定方法,双目视觉的一种灵活标定方法(Zhang s calibration method based on Matlab)
    2011-06-30 09:52:03下载
    积分:1
  • MATLAB_image_process
    matlab图形图像书籍,对刚入门使用Matlab处理图像的同学帮助很大。(matlab graphics image books, great help to students who just started to use Matlab to process images.)
    2013-03-04 15:06:12下载
    积分:1
  • MATLAB
    二参数的遗传算法matlab源代码,简单易懂,适用性强(Two parameters of the genetic algorithm matlab source code, easy to understand, and applicability)
    2013-05-12 13:04:36下载
    积分:1
  • emdPinstfreq
    主要是关于经验模态分解的还有EEMD的代码(Mainly on empirical mode decomposition EEMD code there)
    2014-01-14 17:34:43下载
    积分:1
  • ControlYourPCWithMobilePhone_src
    Control your PC with Mobile Phone-it controls your pc using mobile phone from anywhere in the world. A command can be send by mobile phone through sms.Based on the command ur pc performs tasks such as shut down,open file,play music etc.
    2009-03-11 13:43:34下载
    积分:1
  • u5
    说明:  这个MUSIC算法好像有点问题,望大家帮忙(the MUSIC algorithm appears to be a problem, we hope to see help)
    2007-05-18 19:22:55下载
    积分:1
  • Sat
    卫星测定轨教材《卫星轨道原理,模型和方法》的,随书光盘(Satellite orbit theory, model and method,CD ROM)
    2015-01-04 19:21:33下载
    积分:1
  • Turbo_BPSK
    Turbo Code, Co-Channel Interference
    2010-10-15 23:04:40下载
    积分:1
  • anquanguohe
    先定义允许状态S={(x,y)|x=0或3,y=0,1,2,3 x=y=1,2}, 允许决策D={(u,v)|u+v=1,2},求dk<-D(k=0,1,2,…,n),使 状态Sk<-S按照状态转移律S(k+1)=S(k)+(-1)^k*dk,由初始状态 S1=[3,3]经有限步到达状态S(n+1)=[0,0].此为求解多步决策问题( First define to allow the state S = ((x, y) | x = 0 or 3, y = 0,1,2,3 x = y = 1,2), to allow the decision-making D = ((u, v) | u+ v = 1,2), seek dk < -D (k = 0,1,2, ..., n), so that state Sk < -S state transition in accordance with law S (k+1) = S (k )+ (-1) ^ k* dk, from the initial state S1 = [3,3] by the finite-step to reach the status S (n+1) = [0,0]. This is a multi-step decision-making problem solving)
    2010-02-17 12:02:50下载
    积分:1
  • cs-omp
    关于压缩感知使用的凸优化工具包,非常实用,基于OMP的压缩感知。能够有效的压缩信息。(About compressed sensing using convex optimization toolkit, very practical, perception-based compression OMP. Can effectively compress the information.)
    2015-01-01 21:29:14下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载