- uart0 ARM7 LPC213x UART0串口通信程序
- LDPC ldpc码的编译码算法
- KeyboardHook 一个键盘奏鸣曲程序
- SiLabsUSBDriverDisk.dmg OSX drivers for serial usb adapter silab
- 利用Shapefile进行分幅裁剪 ENVI 插件
- C#项目开发案例全程实录(第2版).(配书源码) 该资料为《C#项目开发案例全程实录(第2版)》的配书源码;里面代码很齐全;(This information is the source code of the supplementary book of "C# Project Development Case Whole Record (2nd Edition)"; the code inside is complete;)
文件名称:dijikstra
介绍说明--下载内容来自于网络,使用问题请自行百度
For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).-For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
(系统自动生成,下载前可以参看下载内容)
下载文件列表
dijikstra.m
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.