Description: 对于无向图或有向图，程序可以计算出图中每两个顶点之间的最短路径，并列出Floyd算法的具体实现-For undirected graph or directed graph, the program can calculate a figure between every two vertices of the shortest path, and lists the specific realize Floyd algorithm Platform: |
Size: 192512 |
Author:王海涛 |
Hits:
Description: 此程序是我在作毕业设计时做的在c#环境下，用于dijkstra最短路径算法的实现，程序相当完美，希望能为大家提供便利。-This program is my design to do for graduation in the c# Environment Dijkstra shortest path algorithm for the realization process is perfect, hope to be able to facilitate everyone. Platform: |
Size: 16384 |
Author:zzbzzb |
Hits:
Description: 使用AStar算法实现的寻找最短路径的演示程序，使用C++编写的MFC程序，有非常好看的界面。-Use AStar the shortest path algorithm to look for the demonstration program, using C++ program written in MFC, there is a very nice interface. Platform: |
Size: 1905664 |
Author:李云龙 |
Hits:
Description: 本程序用c++实现了地杰斯特拉算法，即求最短路径，这一个关于算法的小程序，是关于数据结构中求最短路径的一次演示-This procedure using c++ implementation of the land Jiesitela algorithm, that is, seeking the shortest path, this one on the algorithm for a small program on the data structure in seeking the shortest path in a demonstration Platform: |
Size: 1887232 |
Author:monzart |
Hits:
Description: 该程序在C环境下编译通过，共有5个函数。分别是Introduce，shortestdistance，floyed，display及main。
其功能分别是：
Introduce：地点介绍函数。
Shortestdistance：计算两地的最短距离。
Floyed：floyed算法求两地的最短距离。
Display：打印两个地点的路径及最短距离至屏幕。
Main：总体控制各函数并提供原始数据。
-
Procedures in the C environment compiled through, a total of 5function. Are Introduce, shortestdistance, Floyed, display and main.
Its functions are:
Introduce: place of presentation function.
Shortestdistance: compute the shortest distance.
Floyed: Floyed algorithm for the shortest distance.
Display: print two locations of the path and the shortest distance to the screen.
Main: overall control function and provides original data. Platform: |
Size: 11264 |
Author:霍佳骥 |
Hits:
Description: 图论算法在计算机科学中扮演着很重要的角色，它提供了对很多问题都有效的一种简单而系统的建模方式。很多问题都可以转化为图论问题，然后用图论的基本算法加以解决。遗传算法是解优化问题的有效算法，而并行遗传算法是遗传算法研究中的一个重要方向，受到了研究人员的高度重视。(Graph theory plays an important role in computer science. It provides a simple and systematic modeling method for many problems. Many problems can be translated into graph theory problems, and then solved by the basic algorithm of graph theory. Genetic algorithm is an efficient algorithm for solving optimization problems, and parallel genetic algorithm is an important direction of genetic algorithm research, and has attracted much attention of researchers.) Platform: |
Size: 27648 |
Author:四姑娘
|
Hits:
Search - program for shortest path in c