Description: 用JAVA写的最短路径算法(在GIS开发尤其是WEBGIS开发中非常有用！)-using Java to write the shortest path algorithm (especially in the development of GIS development of WEBGIS is very useful!) Platform: |
Size: 258048 |
Author:崔振磊 |
Hits:
Description: 用图形用户界面表示的图，数据结构基本应用，最小生成树算法，最短路径，广度、深度优先搜索-graphical user interface with the plan said, the basic data structure application, the minimum spanning tree algorithm, the shortest path, breadth, depth-first search Platform: |
Size: 61440 |
Author:张旭 |
Hits:
Description: javaACS 蚁群算法是人工智能的一种算法,这个是用JAVA写的一个求解TSP的程序-javaACS ant algorithm is an artificial intelligence algorithm, This is written in JAVA using a procedure for TSP Platform: |
Size: 20480 |
Author:刘星 |
Hits:
Description: java编写的最短路径算法，先由启发式方法获得染色体的初始编码，然后由遗传算法求出最短路径，对解决物流领域的TSP是非常好的计算机实现-java prepared by the shortest path algorithm, by the heuristic method to obtain the initial encoding of chromosome, and then by the genetic algorithm to derive the shortest path to solve the TSP area of logistics is a very good computer Platform: |
Size: 312320 |
Author:wangxiaofang |
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: Wireless links are often asymmetric due to heterogeneity in the transmission power of devices, non-uniform environmental noise, and other signal propagation phenomenon. Unfortunately, routing protocols for mobile ad hoc networks typically work well only in bidirectional networks. Platform: |
Size: 69632 |
Author:sakthivel |
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 in java