Description: 用VB写的用于计算最短路径的Dijkstra算法-Written by VB used to calculate the shortest path algorithm of Dijkstra Platform: |
Size: 14336 |
Author:黎妹红 |
Hits:
Description: 数据结构常用算法之一-Dijkstra算法,实现最短路径选择.-algorithm commonly used data structures one-Dijkstra algorithm to achieve the shortest path to choose. Platform: |
Size: 251904 |
Author:陈钊 |
Hits:
Description: 用applet显示的Dijkstra算法,用于计算图论中点到点的最短距离-using applet shows the Dijkstra algorithm used in the calculation of graph theory point-to-point shortest distance Platform: |
Size: 8192 |
Author:aaa |
Hits:
Description: 求解一个最短路径问题程序，可以参考一下求一个Dijkstra优化算法！
谢谢了
目的是求给定两点之间的最短距离
或者改一下我的程序也行
-shortest path to solve a problem of procedure, can seek a reference Dijkstra algorithm optimization! Thank you, the purpose is scheduled for 2:00 to the shortest distance between or change my procedure OK Platform: |
Size: 3072 |
Author:Bill |
Hits:
Description: dijkstra算法，用于寻找已建立图的最短路径，是非常有用的一个算法-Dijkstra algorithm, has been established for finding the shortest path map is a very useful algorithm Platform: |
Size: 1024 |
Author:apple |
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 algorithm例程．直接读取文本文件并完成计算．设置为最大可读５１２点．-Personal completed dijkstra algorithm routines. Read a text file directly and complete the calculation. Set to the maximum 512 points readable. Platform: |
Size: 1024 |
Author:Alvin |
Hits:
Description: Dijkstra算法，Delphi语言实现，用来求解最短路-Dijkstra algorithm, Delphi language used for solving the shortest path Platform: |
Size: 3072 |
Author:王小涵 |
Hits:
Description: 一个很好的dijkstra算法程序。强烈推荐大家下载！-Dijkstra algorithm a very good program. Strongly recommend you to download! Platform: |
Size: 1024 |
Author:陈胜 |
Hits:
Description: 最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。
Dijkstra算法是很有代表性的最短路算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。
-The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path 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 end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on. Platform: |
Size: 1024 |
Author:haiyan |
Hits:
Search - dijkstra algorithm