Description: This code implements the shortest path algorithm via the simple scheme and fibonacci heap data structure. It has 3 kinds of testing data input method : random input by computer, reading from the file, reading from the key board. Platform: |
Size: 19456 |
Author:heavenflames |
Hits:
Description: 本代码可以用于查找指定地图中点与点之间的最短路径，例如查找两站牌之间的最佳公交线路。-This code can be used to find the midpoint of the specified map with the shortest path between points, such as licensing between the two stations to find the best bus lines. Platform: |
Size: 7168 |
Author:肖超伟 |
Hits:
Description: 遗传算法与蚁群算法演示程序~
城市间最短路径和曲线图-Genetic algorithm and ant colony algorithm demo program ~ the shortest path between cities and the curves Platform: |
Size: 605184 |
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: K-shortest算法实现，采用Java语言，能根据不同的拓扑找到k条最短路径。非常经典。-K-shortest algorithm using Java language, can be found according to different topological k be the shortest path. Very classic. Platform: |
Size: 49152 |
Author:wei |
Hits:
Description: 在城市智能交通中,经常会用到最短路径的问题,比如找最佳的行车路线等,Dijkstra算法做为最经典的求解方法,为我们指明了方向.不过真正想让我了解该算法的原因是在学习ICTCLAS的N-最短路径算法。-Intelligent Transportation in the city, often used the issue of the shortest path, for example, to find the best travel routes, Dijkstra s algorithm for solving the classical methods, pointing out the direction for us. But I really want to understand the reasons for the algorithm ICTCLAS in the study of the N-shortest path algorithm. Platform: |
Size: 13312 |
Author:索男 |
Hits:
Description: 旅行商问题的源代码及其说明。给出空间中给定n个点，画一条简单路径，包括所有的点，使得路径最短-Traveling Salesman Problem and its description of the source code. Given space in a given n points, draw a simple path, including all the points, making the shortest path Platform: |
Size: 3072 |
Author:hbk hsu |
Hits:
Description: 这是一个用Java编写的最短路算法，很实用。-It is written in Java using a shortest path algorithm is very practical. Platform: |
Size: 1024 |
Author:陈严 |
Hits:
Description: Simplified version of a system that finds the fastest or shortest trip along a network of roads, is an instance of the single-source, positive-weighted, shortest-path problem. In other words, from one particular vertex (a “single source”), we’ll be finding the shortest path to another vertex where all of the edges have a “positive weight” (in our case, distance or speed) associated with them. Platform: |
Size: 9216 |
Author:Ron |
Hits:
Search - shortest path java