Location:
Search - dijkstra c
Search list
Description: 用VC学的Dijkstra算法,压缩包解压时没有密码.供学习使用
Platform: |
Size: 1252 |
Author: cqu2000 |
Hits:
Description: 数据结构常用算法之一-Dijkstra算法,实现最短路径选择.-algorithm commonly used data structures one-Dijkstra algorithm to achieve the shortest path to choose.
Platform: |
Size: 7428 |
Author: 陈钊 |
Hits:
Description: C++写的最短路径Dijkstra算法，注释相当详细，方便初学者学习
Platform: |
Size: 3150 |
Author: speeter |
Hits:
Description: Dijkstra算法求最短路径
c语言源码，数据结构学习
Platform: |
Size: 39424 |
Author: sxccw2 |
Hits:
Description: 数据结构常用算法之一-Dijkstra算法,实现最短路径选择.-algorithm commonly used data structures one-Dijkstra algorithm to achieve the shortest path to choose.
Platform: |
Size: 251904 |
Author: 陈钊 |
Hits:
Description: 图论算法库 C++ 语言实现
代码内容 图论算法库，包括以下算法：
单源最短路径 Dijkstra 算法
单源最短路径 Bellman-Ford 算法
最小生成树 Prim 算法
每对节点间最短路径 Flod-Warshall 算法
语言 C++
编译平台 VisualAge C++ 4.0
作者 starfish (starfish.h@china.com)
备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。
该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。 虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -graph algorithm for C language code content graph algorithm library, including the following algorithm : single-source shortest path algorithm Dijkstra single source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall ALGOL C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, the VisualAge C 4.0 debugging through. The compressed file contains all Graph.h the library, the procedure call interface, see the Notes. Other documents algorithm is used to test the test procedures in VisualAge C compiler running under 4.0. The algorithm is for me to participate in ACM/Illinois prepared to contest the information, because the competition for high speed
Platform: |
Size: 10240 |
Author: 罗鹏魁 |
Hits:
Description: Windows应用程序，C#编写，实现了求最短路径的Dijkstra算法，方便操作，可以自已在程序界面上指定每一个点的位置，在界面上空白的地方每点击一下生成一个点（该点是一个可以点击的按钮），这些按钮按照出现的先后顺序自动从1开始编号（目前程序设定最多支持100个点，可自行更改）。界面右上角是计算结果显示区，往下是权值输入区和“连线”、“清屏”“计算”三个按钮以及状态区，状态区显示当前的起点和终点，连线和计算都要用到该信息（点击生成的顺序编号的那些按钮可以依次改变起点和终点）。输入权值后点“连线”则把编号为状态区显示的起点和终点连接起来，并在线的中央标明权值。点击“计算”则计算状态区显示的起点和终点的最短距离及路径，并将结果输出到右上角。右下角为异常显示区，显示程序运行过程中出现的异常，比如权值输入一个字母，因字母无法转为整型，就会产生异常，该异常信息就显示在右下角。-Windows applications, C#, for the realization of the Dijkstra shortest path algorithm, convenient operation, the procedure can own interface on a point each designated location, gaps at the interface of each click generated a point (the point is a can click on the button), these buttons with the automatic sequence starting from No. 1 (the current procedure set up to support 100 points can make changes). Instructions interface is calculated results show, right down the value of the importation and the "Alliance" "screen" "calculated" button and the three state area, the current state of the district show the starting and finishing points. Alliance and calculation should use the information (click generation of serial numbers of those buttons can be followed to
Platform: |
Size: 11264 |
Author: |
Hits:
Description: 用c语言编写的Dijkstra算法的源代码。代码短小精炼有注释-Using c language source code Dijkstra algorithm. Refining short code annotated
Platform: |
Size: 1024 |
Author: wxr |
Hits:
Description: Dijkstra算法求最短路径(C#版) using System
using System.Collections
using System.Text
namespace Greedy
{
class Marx
{
private int[] distance
private int row
private ArrayList ways = new ArrayList()
public Marx(int n,params int[] d)
{
this.row = n
distance = new int[row * row]
for (int i = 0 i < row * row i++)
{
this.distance[i] = d[i]
-Dijkstra algorithm for shortest path (C# Version) using System using System.Collections using System.Text namespace Greedy (class Marx (private int [] distance private int row private ArrayList ways = new ArrayList () public Marx (int n, params int [] d) (this.row = n distance = new int [row* row] for (int i = 0 i
Platform: |
Size: 209920 |
Author: wwf |
Hits:
Description: 网络最短路径Dijkstra算法（C++语言）。-err
Platform: |
Size: 3072 |
Author: 邓权帅 |
Hits:
Description: 经典求最短路径算法程序--dijkstra算法。完整的C++源码程序。-Classical procedures seek the shortest path algorithm Dijkstra algorithm. Complete C++ Source procedures.
Platform: |
Size: 1024 |
Author: 刃具 |
Hits:
Description: Floyd-Warshall算法描述
1)适用范围：
a)APSP(All Pairs Shortest Paths)
b)稠密图效果最佳
c)边权可正可负
2)算法描述：
a)初始化：dis[u,v]=w[u,v]
b)For k:=1 to n
For i:=1 to n
For j:=1 to n
If dis[i,j]>dis[i,k]+dis[k,j] Then
Dis[I,j]:=dis[I,k]+dis[k,j]
c)算法结束：dis即为所有点对的最短路径矩阵
3)算法小结：此算法简单有效，由于三重循环结构紧凑，对于稠密图，效率要高于执行|V|次Dijkstra算法。时间复杂度O(n^3)。
考虑下列变形：如(I,j)∈E则dis[I,j]初始为1,else初始为0，这样的Floyd算法最后的最短路径矩阵即成为一个判断I,j是否有通路的矩阵。更简单的，我们可以把dis设成boolean类型，则每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”来代替算法描述中的蓝色部分，可以更直观地得到I,j的连通情况。
-err
Platform: |
Size: 3072 |
Author: 江晨 |
Hits:
Description: 网络最短路径Dijkstra算法的c语言实现，很有参考价值-Network shortest path Dijkstra algorithm c language, the valuable
Platform: |
Size: 3072 |
Author: 刘明 |
Hits:
Description: Dijkstra算法的实现，代码清晰，易懂-Dijkstra algorithm, the code clear, easy-to-understand
Platform: |
Size: 33792 |
Author: 小江 |
Hits:
Description: 用VC学的Dijkstra算法,压缩包解压时没有密码.供学习使用-VC school with Dijkstra algorithm, when decompression of compressed packets do not have a password. For learning to use
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 这是个完整的c语言编写的dijkstra算法，结果不仅能够显示出源点到其他顶点的最短路径（最小代价值），而且给出了相应的路径。代码浅显易懂，学习此算法的好材料。-This is a complete c languages Dijkstra algorithm, the results can not only show that the source point to the other vertex of the shortest path (the smallest on behalf of the value), and the corresponding path. Code easy to understand and learn from this algorithm good material.
Platform: |
Size: 1024 |
Author: chenxiaohua |
Hits:
Description: Dijkstra算法C程序实现，可以在windows和linux下运行，-Dijkstra algorithm C program can run under windows and linux,
Platform: |
Size: 2048 |
Author: 惠高潮 |
Hits:
Description: Dijkstra算法是典型的最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。Dijkstra算法是一种逐步搜索算法，通过为每个顶点n保留目前为止所找到的从m到n的最短路径来工作的。
c#实现算法-Dijkstra algorithm is a typical example of the most short-circuit algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the date extended to the end. Dijkstra shortest path algorithm can arrive at the optimal solution, but because it traverse a lot of computing nodes, so inefficient. Dijkstra algorithm is a step by step search algorithm for each vertex n reservations so far found from the m to n shortest path to work. c# algorithm
Platform: |
Size: 2048 |
Author: kivilin |
Hits:
Description: 一个用vc2005开发的C语言的dijkstra实现，相对简单图结构矩阵表示。-Vc2005 with the development of a C-language dijkstra to achieve a relatively simple graph structure matrix.
Platform: |
Size: 412672 |
Author: 杨福绅 |
Hits:
« 12
3
4
5
6
7
8
9
10
...
14
»