Location:
Search - dijkstra basic
Search list
Description: 用VB写的用于计算最短路径的Dijkstra算法-Written by VB used to calculate the shortest path algorithm of Dijkstra
Platform: |
Size: 14336 |
Author: 黎妹红 |
Hits:
Description: 一、 目的：
对应数据结构课程所学的基本原理和方法，学习图状结构求最短路径的算法，将理论知识运用于实际。
二、 任务：
请根据附图和附表，设计一个武汉市交通导引系统。用户输入起点站和目标站，系统显示起点站到目标站的最短路径。
三、 要求：
1. 提示用户输入起点站和目标站
2. 系统向用户显示一条最短路径（经过站数最少的路线），如果有两条以上最短路线，则按换乘次数排序显示。
3. 显示每一条路线时，不仅要显示应搭乘的车次，还要显示应搭乘站的站名。
四、 提示：
将每一站的权值设定为1，可以使用Dijkstra算法实现。
-one purpose : Corresponding data structure courses are taught the basic principles and methods learning map structure for the shortest path algorithm, the actual application of theoretical knowledge. Two tasks : According to the attached map and schedule, design a Wuhan city traffic guidance system. User input starting point and goal of stations, the system shows starting point to the target point is the shortest path. 3, asked : 1. prompt the user input starting point and goal of Station 2. System users to show a shortest path (at least after a few stops the line ), if there are more than two shortest routes, according to the number of transfer order shows. 3. To show a line, not only to show that the vehicles should take, but also indicate that it should be traveled Station in name. 4, T
Platform: |
Size: 172032 |
Author: 李明 |
Hits:
Description: vb实现最短路径Dijkstra算法，很经典的算法。-vb realize Dijkstra shortest path algorithm, it is the classic algorithms.
Platform: |
Size: 36864 |
Author: qintao |
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: //有向图:有向图,无向图基本操作
//运行环境：VC
//有向图,无向图基本操作,包括:
//1、邻接矩阵
//2、邻接表
//3、深度优先遍历
//4、广度优先遍历
//5、最小生成树
//6、拓扑排序
//7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environment: VC// directed graph, undirected graph basic operation, including:// 1, adjacency matrix// 2, the adjacent table// 3 , depth-first traversal// 4, breadth-first traversal// 5, minimum spanning tree// 6, topological sorting// 7, each of the shortest path between vertices (Dijkstra, Floyd two algorithms)
Platform: |
Size: 3072 |
Author: atom |
Hits:
Description: dijkstra算法源代码，实现了dijkstra算法，并附有一个简单路网文件-dijkstra algorithm source code, to achieve the dijkstra algorithm, together with a simple network file
Platform: |
Size: 4096 |
Author: 姜智勇 |
Hits:
Description: Dijkstra算法的基本思路是：假设每个点都有一对标号 (dj, pj)，其中dj是从起源点s到点j的最短路径的长度 (从顶点到其本身的最短路径是零路(没有弧的路)，其长度等于零)；pj则是从s到j的最短路径中j点的前一点。求解从起源点s-Dijkstra algorithm is the basic idea: the assumption that each point has a pair of numbers (dj, pj), which is a dj point s from the origin point j the length of the shortest path (from the vertex to the shortest path to their own way is zero (no arc of the road), its length equal to zero) pj from s to j in the shortest path before the point j point. S from the origin point for solving
Platform: |
Size: 50176 |
Author: 文 |
Hits:
Description: VB+MapX实现Dijkstra算法，通过输入起始点坐标可以得到两点间的最短路径-Implement the Dijkstra algorithm By Visual Basic And MapX5.0
Platform: |
Size: 25600 |
Author: 荆凯旋 |
Hits:
Description: 简单的实现Dijkstra算法求最短路径，能输几个节点及各个节点的距离，然后算出中心节点与其他节点的最短路径。-Simple implementation Dijkstra algorithm seek shortest path, can lose several node and various node distance then calculated center node with other node shortest path.
Platform: |
Size: 54272 |
Author: 朝 |
Hits:
Description: Dijkstra algorithm Visual Basic 6.0
Platform: |
Size: 35840 |
Author: peterbest52 |
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: Disjtra en visual basic de algoritmo de estados
Platform: |
Size: 2048 |
Author: Julio G |
Hits:
Description: 狄克斯特拉算法，在通信网结构设计和选择路径时最基本的两种算法之一。-Dick Stella algorithm, the communication network design and selection of path one of the most basic of the two algorithms.
Platform: |
Size: 1024 |
Author: 小名 |
Hits:
Description: Dijkstra算法是寻找图中最短路径的基本算法，这里是用java实现-Dijkstra s algorithm is to find the shortest path graph of the basic algorithm, to achieve here is to use java
Platform: |
Size: 1024 |
Author: wen |
Hits:
Description: Dijsktra算法，图论中的基础算法，用来求网络图中始发点到各个点的最短路，并给出权值-Dijsktra algorithms. in graph theory of the basic algorithm that is used to ask the network diagram to the point of the short, and gives to
Platform: |
Size: 1024 |
Author: sqq |
Hits:
Description: Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法是很有代表性的最短路径算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。Dijkstra一般的表述通常有两种方式，一种用永久和临时标号方式，一种是用OPEN, CLOSE表的方式，这里均采用永久和临时标号的方式。注意该算法要求图中不存在负权边。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm used to calculate the shortest path of a node to all other nodes. The main features are the starting point as the center outward expansion of the layers, until the extension to the end point so far. Dijkstra algorithm is very representative of the shortest path algorithm, described in detail in many professional courses as a basic content, such as data structures, graph theory, operations research, etc.. Dijkstra general statements are generally two ways, a permanent and temporary label, an OPEN, CLOSE table, here are the way of permanent and temporary label. Note that the algorithm requires that the figure does not negative the right side.
Platform: |
Size: 98304 |
Author: yx |
Hits:
Description: 迪杰斯克拉无向图最短路径----dijkstra
这是帮同学完成的Project，老外老师的要求果然不同。对于基本算法，不光要求不能使用高级容器类，还要求程序有一定的检验错误能力。花了1天的时间写完，代码考虑结点过多内存占用的问题，因此关系矩阵采用映射的方式存储。由此带来的弊端是，找一个结点的时候需要循环判断，导致效率过低。总之，内存占用与程序效率是鱼与熊掌不可兼得。
代码写的比较凌乱。仅供参考。
Project的要求介绍参考链接：
http://hi.baidu.com/yiyiyis/blog/item/1d12842a6ae51c21d52af1d0.html?timeStamp=1292219252654-Dinger undirected graph Sklar---- dijkstra shortest path is to help students complete the Project, the teacher asked foreigners really different. For the basic algorithm, not only asked not to use the advanced containers, also called the inspection program has a certain error capacity. It took 1 day of time to finish, the code takes into account node issue too much memory, so by mapping relationship matrix stored. The resulting drawback is to find a node to determine when the need for recycling, resulting in low efficiency. In short, the efficiency of memory usage and process fish and can not have both. Comparison of writing messy code. For reference only. Project requirements description reference links: http://hi.baidu.com/yiyiyis/blog/item/1d12842a6ae51c21d52af1d0.html?timeStamp=1292219252654
Platform: |
Size: 190464 |
Author: 方毅 |
Hits:
Description: Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法是很有代表性的最短路径算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。Dijkstra一般的表述通常有两种方式，一种用永久和临时标号方式，一种是用OPEN, CLOSE表的方式，这里均采用永久和临时标号的方式。注意该算法要求图中不存在负权边。
-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm, is used to calculate a node to all other nodes in the shortest path. The main features is the starting point as the center outward expansion layers until the extension to the end point. Dijkstra algorithm is very representative of the shortest path algorithm, the basic content as described in detail in many professional courses, such as data structures, graph theory, operations research, and so on. Dijkstra' s general statements are generally two ways, one permanent and temporary label, one is using the OPEN, CLOSE table, there are permanent and temporary label. Note that the algorithm requires that the figure does not exist in the negative right side.
Platform: |
Size: 1024 |
Author: 吕子乔 |
Hits:
Description: Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。本算法时间复杂度完全符合要求。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm, is used to calculate a node to all other nodes in the shortest path. The main features is the starting point as the center outward expansion layers until the extension to the end point. Dijkstra algorithm is very representative of the shortest path algorithm, the basic content as described in detail in many professional courses, such as data structures, graph theory, operations research, and so on. Dijkstra s general statements are generally two ways, one permanent and temporary label, one is using the OPEN, CLOSE table, there are permanent and temporary label. Note that the algorithm requires that the figure does not exist in the negative right side.
Platform: |
Size: 1024 |
Author: 吕子乔 |
Hits:
Description: 对spf算法的一个简单实现，大家可以交流交流- This article puts forward the method of the application of SPF algorithm in IS-IS route after the introduction of the basic principle of SPF algorithm and the way of realizing the best calculation route with IS- IS SPF on Cisco Router.
Platform: |
Size: 1024 |
Author: 小天 |
Hits: