登录
首页 » matlab » Untitled8

Untitled8

于 2011-10-25 发布 文件大小:1KB
0 222
下载积分: 1 下载次数: 29

代码说明:

  一个matlab程序,可以实现将excel文件转为邻接矩阵。(a programme that can transform the excel into adj_matrix in matlab)

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

发表评论

0 个回复

  • shujutongjifenxi2
    数据的统计描述与分析的matlab实现与分析(Statistical description and analysis matlab realize and Analysis)
    2007-09-22 13:53:58下载
    积分:1
  • askd
    amplitude shift keying
    2009-12-01 17:05:56下载
    积分:1
  • leng
    基带OFDM系统的M文件,对初学者有很大的参考价值(the code of the article was based on OFDm, have a very high reference value.)
    2009-05-16 16:48:29下载
    积分:1
  • AMS_R14_2006A
    PLLmatlab for simulink(PLLmatlab for Simulink)
    2007-01-31 17:03:15下载
    积分:1
  • 图像处理-去噪、压缩(Matlab GUI)
    说明:  MATLABC基础学习,GUI编程,降噪,图像处理-去噪、压缩(Matlab GUI)(MATLABC basic learning, GUI programming, noise reduction, image processing-denoising, compression (Matlab GUI))
    2020-09-05 21:03:06下载
    积分:1
  • Ababoostdemo
    ababoost级联分类器,通过一组弱分类器形成一个强分类器(cascade of classification)
    2009-05-04 17:54:37下载
    积分:1
  • NLMS
    该程序为用matlab编写的自适应滤波程序(The program prepared for the use of adaptive filtering matlab program)
    2008-03-21 17:02:41下载
    积分:1
  • 2009101511474503
    用matlab编写的用于车牌识别的程序,识别车牌,并辨认出字母和数字(Using matlab to prepare for license plate recognition program, identify license plates and identify letters and numbers)
    2010-02-26 10:30:53下载
    积分:1
  • kfold
    Create a Neural Network with matlab
    2012-04-23 19:13:53下载
    积分:1
  • Matlab_zuixiaofeiyong
    最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.(Minimum cost maximum flow algorithm general Matlab functions The basic idea of ​ ​ the shortest path algorithm of Ford and Fulkerson superposition algorithm based on Floyd: the cost of unit flow on the arc as a certain length of Floyd and the shortest path method to determine the one percent self-V1 to the Vn the most short-circuit and then the this Article is the most short-circuit as a can be the expansion Lu, to use solving the method of the the the problem of the maximum flow will its on the stream the amount of increased to the maximum possible values while the the the the flow of of this Article of the shortest on the road increase, the costs of the unit of flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
    2012-07-27 14:55:22下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载