Location:
Search - Dijkstra
Search list
Description: 一个很好的dijkstra算法程序。强烈推荐大家下载！-Dijkstra algorithm a very good program. Strongly recommend you to download!
Platform: |
Size: 1024 |
Author: 陈胜 |
Hits:
Description: 一个基于JAVA的Dijkstra算法程序,可用于仿真中作为路由算法的一个组件.包含网络拓扑及使用方法的代码.-JAVA based on the Dijkstra algorithm procedure can be used for simulation as a component of routing algorithm. Contains network topology and how to use the code.
Platform: |
Size: 2048 |
Author: 测试人员 |
Hits:
Description: 最短路径Dijkstra算法，是用Ｃ＃编的，很经典的算法-Dijkstra shortest path algorithm is the use of C
Platform: |
Size: 29696 |
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 shortest path data structure design, as well as the traffic graph algorithm!
Platform: |
Size: 64512 |
Author: ying |
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: Dijkstra算法源码，图论中求解最短路径-Dijkstra algorithm source, graph theory for solving the shortest path
Platform: |
Size: 2048 |
Author: 秋水长天 |
Hits:
Description: Dijkstra算法，实现加权有向图中从确定的起点寻找最短路径并输出-Dijkstra algorithm, to achieve a weighted directed graph from the starting point to determine the shortest path to find and output
Platform: |
Size: 180224 |
Author: 曹雷 |
Hits:
Description: Dijkstra最短路径 void output_path(int v)-Dijkstra shortest path void output_path (int v)
Platform: |
Size: 3072 |
Author: 肖加可 |
Hits:
Description: dijkstra算法，简单实现路由算法，相对容易-Dijkstra algorithm, a simple realization of the routing algorithm, is relatively easy
Platform: |
Size: 178176 |
Author: 文刀 |
Hits:
Description: Dijkstra最短路算法 .详细中文注释.-Dijkstra shortest path algorithm. Detailed English Notes.
Platform: |
Size: 1024 |
Author: Jiandong Yang |
Hits:
Description: 这是数据结构中关于dijkstra算法的c语言程序，对于初学者很有帮助-djikstra c
Platform: |
Size: 1024 |
Author: linda |
Hits:
Description: 用Dijkstra算法实现最短路径，在VC++6.0中运行-Using Dijkstra shortest path algorithm in VC++6.0 run
Platform: |
Size: 927744 |
Author: 王飞飞 |
Hits:
Description: 用java实现的Dijkstra算法，当用户输入起始点和终点时，会自动产生两点之间的最短路径-Using java implementation of the Dijkstra algorithm, when the user enters the starting point and end point, it will automatically generate the shortest path between two points
Platform: |
Size: 4096 |
Author: jingjing wang |
Hits:
Description: 该问题为单元最短路经问题，求出一个有向图中两点之间权值最小的路径。 Dijkstra算法要求有向图中没有权值为负的边，有向图的信息由一个邻接表来表示，另外对每个顶点都设置一个属性d[v]，描述从源点到v的最短路经上权值的上界。算法中设置一个顶点集合S，反复选择具有最短路经估计的顶点u∈V-S,并将u加入S中，算法中还用到了顶点的最小优先队列，排序关键字为顶点的d值。-The issue of the shortest path problem as a unit, find a directed graph between two points of the path of minimum weight. Dijkstra algorithm requires no power to map the edge value is negative, the information to the map by an adjacency list to represent an additional set of each vertex is an attribute d [v], described from the source point to the most short-circuit v on the right by the upper bound value. Algorithm to set up a vertex set S, repeatedly choose the shortest path with the vertex is estimated u ∈ VS, will u join the S, the algorithm is also used in the vertex of the smallest priority queues, sorting for the vertex of the d keyword value.
Platform: |
Size: 6144 |
Author: 晶 |
Hits:
Description: 计算dijkstra求最短路径:Dijkstra算法的基本思路是：假设每个点都有一对标号 (dj, pj)，其中dj是从起源点s到点j的最短路径的长度 (从顶点到其本身的最短路径是零路(没有弧的路)，其长度等于零)；pj则是从s到j的最短路径中j点的前一点。求解从起源点s到点j的最短路径算法的基本过程如下-find the shortest road
Platform: |
Size: 1024 |
Author: 刘国胜 |
Hits:
Description: Dijkstra algorithm in Java.
Platform: |
Size: 70656 |
Author: jason |
Hits:
Description: dijkstra算法源代码，实现了dijkstra算法，并附有一个简单路网文件-dijkstra algorithm source code, to achieve the dijkstra algorithm, together with a simple network file
Platform: |
Size: 4096 |
Author: 姜智勇 |
Hits:
«
1
2
34
5
6
7
8
9
10
...
50
»