Description: 用VB写的用于计算最短路径的Dijkstra算法-Written by VB used to calculate the shortest path algorithm of Dijkstra Platform: |
Size: 14336 |
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: 由graph.txt读出源图并用临街链表显示出，然个用dijkstra算法算出给定两点的最短路径和任一给定点到其它各点的距离，graph.txt放在源代码同一目录，内附graph.txt示例-graph.txt read out by the source map and used chain along the street shows, However use the dijkstra algorithm to calculate the scheduled 2:00 and the shortest path as a sentinel for other points of the distance, graph.txt on the same source code directory, containing examples graph.txt Platform: |
Size: 702464 |
Author:比为 |
Hits:
Description: 时间复杂度为O(ElogV)的Dijkrastra算法的实现，解决城市道路网的最短路径问题，可以计算1000×1000个节点。-Time complexity is O (ElogV) of Dijkrastra algorithm to address the urban road network, shortest path problem, can calculate the 1000 × 1000 nodes. Platform: |
Size: 2452480 |
Author:刘金义 |
Hits:
Description: 单源最短路径问题：给定带权有向图G=(V,E)。给定V中的一个顶点v，称为源。要计算从源到所有其它各顶点的最短路径长度。-Single-source shortest path problem: a given weighted directed graph G = (V, E). Given a vertex V in v, known as the source. To calculate from the source to all other vertices of the shortest path length. 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:
Description: Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。
-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. Platform: |
Size: 2048 |
Author:yjl |
Hits:
Description: Dijkstra算法是典型的最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。Dijkstra算法是一种逐步搜索算法，通过为每个顶点n保留目前为止所找到的从m到n的最短路径来工作的。
-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. Platform: |
Size: 1024 |
Author:kivilin |
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: 計算兩點之間最短距離的演算法，可以自定幾個點和之間長度-Calculate the shortest distance between two points of the algorithm, you can customize the length of a few points and between Platform: |
Size: 167936 |
Author:herry |
Hits:
Description: Dijkstra算法是典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径。-Dijkstra' s shortest path algorithm is a typical routing algorithm used to calculate a node to all other nodes in the shortest path. Platform: |
Size: 1024 |
Author:花脸的猫 |
Hits:
Description: dijkstra algorithm is mainly used to calculate shortes path in between source and destination. it has the time complexity of o(n log n) Platform: |
Size: 2048 |
Author:govind |
Hits:
Description: Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。
Dijkstra算法是很有代表性的最短路算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。
-Dijkstra algorithm is a typical shortest path algorithm to calculate a node to all other nodes of the shortest path. Main features are a starting point for the center layers expand outward, until the expansion to end up. Dijkstra shortest path algorithm can arrive at the optimal solution, but because it traverses a lot of computing nodes, so efficiency is low. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses are as basic elements in some detail, such as data structures, graph theory, operational research and so on. Platform: |
Size: 6144 |
Author:xyz |
Hits:
Description: Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低-Dijkstra algorithm is a typical shortest path algorithm to calculate a node to all other nodes of the shortest path. Main features are a starting point for the center layers expand outward, until the expansion to end up. Dijkstra shortest path algorithm can be obtained the optimal solution, but because it traverses many computing nodes, so the low efficiency Platform: |
Size: 16384 |
Author:我下下 |
Hits:
Description: Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解-Dijkstra algorithm is a typical shortest path algorithm, to calculate a node to all other nodes of the shortest path. Main features is the starting point for the center outward layers of extended until the extension to the end up. Dijkstra shortest path algorithm to the optimal solution obtained Platform: |
Size: 1024 |
Author:yuan |
Hits:
Description: Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止-Dijkstra' s algorithm is a typical shortest path algorithm used to calculate a node to all other nodes of the shortest path. Main features is the starting point for the center layers expand outward until the end date extended to Platform: |
Size: 1024 |
Author:王勇 |
Hits:
Description: Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，-Dijkstra' s algorithm is a typical shortest path algorithm used to calculate a node to all other nodes of the shortest path. Main features is the starting point for the center outward expansion of the layers, until extended to the end so far. Dijkstra shortest path algorithm can arrive at the optimal solution, Platform: |
Size: 6144 |
Author:刘旭 |
Hits:
Description: Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。
-Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. Main features is the starting point for the center layers expand outward until the extended until the end. Dijkstra shortest path algorithm can arrive at the optimal solution, but because it is through a lot of computing nodes, so the efficiency is low. Platform: |
Size: 4096 |
Author:chaolan |
Hits:
Description: 一个使用了Dijkstra算法的C#小程序，能计算6个点到各位置的最短路径。(A C# applet using Dijkstra algorithm can calculate the shortest path from 6 points to each location.) Platform: |
Size: 367616 |
Author:码农哆啦 |
Hits:
Search - dijkstra calculate