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: 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语言实现最短路径算法中的Bellman-Ford算法，这个算法可以用来解决信号处理中的一些问题。bellman_ford.c为源程序；distance.txt文件存放各界点之间的距离，以99999表示无穷大；bellman_ford.txt文件是输出文件，存放每轮循环得到的中间值，以及最后得到的到各个节点的最短距离，如果图包含负回路，文件中返回FALSE。-C language shortest path algorithm to achieve the Bellman-Ford algorithm, The algorithm can be used to solve signal processing some of the problems. Bellman_ford.c to source; distance.txt document repository all the distance between points, to 99,999 infinite said. bellman_ford.txt document output files, storage cycle round the middle value, and, finally, the various nodes of the shortest distance, if the plan contains negative loop, the paper returns FALSE. Platform: |
Size: 103424 |
Author:李文 |
Hits:
Description: dijkstra算法实现，即最短寻路算法。给出图（有向图或者无向图）中各点间的权值。-Dijkstra algorithm, that is, find the shortest path algorithm. Given graph (directed graph or undirected graph) between various points in the right value. Platform: |
Size: 1991680 |
Author:宝宝 |
Hits:
Description: 用Dijkstra算法求解最短路径，按用户要求输出一个结点到其他任意结点的最短路径，也可以求任意两个结点之间的最短路径-Using Dijkstra shortest path algorithm, the user requests output by a node to another arbitrary node shortest path, you can order any two nodes of the shortest path between Platform: |
Size: 2048 |
Author:szl |
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算法是一种逐步搜索算法，通过为每个顶点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: 一种快速求得最短路径的经典算法，可以在运筹规划或在统筹安排中使用-Express obtained a classic shortest path algorithm, can be planned or in operation in co-ordinating arrangements for the use of Platform: |
Size: 51200 |
Author:chendong |
Hits:
Description: C语言和OpenMP编写的可在多核或SMP处理器上进行多线程运行的最短路径算法。可了解多核多线程和OpenMP的并行编程技术。-C language and can be prepared OpenMP or multi-core processors on SMP multi-threading to run the shortest path algorithm. Learn to multi-core multi-thread and OpenMP parallel programming technology. Platform: |
Size: 2048 |
Author:computing |
Hits:
Description: Dijkstra的算法的c++小程序演示解决的最短路径的问题,希望对大家有用-Dijkstra' s Algorithm in c++ small program demonstrates the shortest path to solve the problem, we want to be useful Platform: |
Size: 533504 |
Author:王鹏 |
Hits:
Search - Dijkstra shortest path