登录
首页 » matlab » shortestpath

shortestpath

于 2013-09-11 发布 文件大小:3KB
0 266
下载积分: 1 下载次数: 2

代码说明:

  基于WLAN室内无线环境,针对点到点之间的最短路径的采用floyd等算法实现仿真。(WLAN-based indoor wireless environment, the shortest path between point for the adoption of such floyd algorithm simulation.)

文件列表:

dinic算法实现.m,698,2012-04-21
dinic算法用到的f_path.m,575,2012-04-21
dinic算法用到的Nf.m,940,2012-04-21
floyd算法实现.m,651,2012-05-08
ford算法实现.m,1578,2012-04-19
任意两点间最短路径实现.m,751,2012-04-23

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

发表评论

0 个回复

  • PWM
    介绍了PWM整流器PI参数设计,并用matlab进行了仿真,很好很强大!(Describes the design of PWM rectifier PI parameters, and use matlab for simulation, the very very powerful!)
    2011-11-08 12:04:34下载
    积分:1
  • similuationofUWBm
    对UWB信道进行估计以及对UWB接收器的性能仿真。(simulation for UWB channel)
    2009-05-13 23:53:39下载
    积分:1
  • PWM-AC-to-DC
    the AC to DC PWM converter with MATLAB
    2012-07-02 06:17:44下载
    积分:1
  • opensees与matlab传递变量_运行通畅
    opensees 调用 matlab 进行参数优化(opensees matlab optimize parameter)
    2021-04-09 20:28:59下载
    积分:1
  • Nhom5
    matlab demo for image compression by wavelet transform
    2010-11-25 16:56:36下载
    积分:1
  • speechtimefre
    speechtimefre 语音时域处理(speechtimefre voice at the Domain)
    2006-06-06 21:37:17下载
    积分:1
  • DCT-and-Image-Compression
    DCT and Image Compression In the JPEG image compression algorithm, the input image is divided into 8-by-8 or 16-by-16 blocks, and the two-dimensional DCT is computed for each block. The DCT coefficients are then quantized, coded, and transmitted. The JPEG receiver (or JPEG file reader) decodes the quantized DCT coefficients, computes the inverse two-dimensional DCT of each block, and then puts the blocks back together into a single image. For typical images, many of the DCT coefficients have values close to zero these coefficients can be discarded without seriously affecting the quality of the reconstructed image. The example code below computes the two-dimensional DCT of 8-by-8 blocks in the input image, discards (sets to zero) all but 10 of the 64 DCT coefficients in each block, and then reconstructs the image using the two-dimensional inverse DCT of each block. The transform matrix computation method is used.
    2014-01-28 16:55:07下载
    积分:1
  • GPIB
    GPIB material881234231
    2010-05-15 22:41:20下载
    积分:1
  • ACO_for_TSP
    使用蚁群算法进行TSP问题的求解,画出了初始城市分布,蚁群算法求得的路线图。(Using the Ant Colony Algorithm to solve the problem of Traveling Salesman Path.The initial distribution of the cities is presented.And the path for the salesman can be seen clearly from the figure.)
    2013-12-09 11:35:12下载
    积分:1
  • Dichotomy-method
    说明:  用于方程求根的二分法。方程求根。二分法。(Dichotomy method to solve the functions.)
    2011-04-07 23:01:11下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载