Description: 用applet显示的Dijkstra算法,用于计算图论中点到点的最短距离-using applet shows the Dijkstra algorithm used in the calculation of graph theory point-to-point shortest distance Platform: |
Size: 8192 |
Author:aaa |
Hits:
Description: 此小程序用java实现了可以分割的背包问题，开发平台是Eclipse。其中主要是用贪心算法实现背包问题，在将物品进行排序时，没有使用经典的merge-sort算法，而是直接使用了java中Arrays类的sort的方法，但要自己定义类，实现接口Comparator。-This small program using java realize the knapsack problem can be separated from the development platform is Eclipse. Which is mainly used greedy algorithm knapsack problem, sort the items in when not using the classic merge-sort algorithm, but the direct use of java in the Arrays class sort method, but their definition of class, realize interface Comparator. Platform: |
Size: 21504 |
Author:gengxin |
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算法做为最经典的求解方法,为我们指明了方向.不过真正想让我了解该算法的原因是在学习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: dijkstra algorithm is mainly used to calculate shortes path in between source and destination. it has the time complexity of o(n log n) Platform: |
Size: 2048 |
Author:govind |
Hits:
Description: 附件中的源码使用java实现了Dijkstra算法求最短路径-Java source code used in the annex to achieve the Dijkstra algorithm for the shortest path Platform: |
Size: 1024 |
Author:王守涛 |
Hits:
Description: THIS A DIJKSTRA ALGORITHM IMPLEMENTED IN JAVA.MORE INFORMATION ABOUT DESCRIPTION OF THE PROCEDURE CAN BE FIND IN SITE: -THIS IS A DIJKSTRA ALGORITHM IMPLEMENTED IN JAVA.MORE INFORMATION ABOUT DESCRIPTION OF THE PROCEDURE CAN BE FIND IN SITE: Platform: |
Size: 207872 |
Author:S |
Hits:
Description: 用java实现路由选择算法。Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。-Java achieve routing algorithm. Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm is used to calculate a node to all other nodes in the shortest path. Platform: |
Size: 78848 |
Author:周莉 |
Hits:
Description: 一个用Dijkstra算法实现的路由算法的java程序,GraphMain为主类，并修改GraphFromFile graph1,graph2,graph3为自己当前环境的本地路径，文件在src\\GraphInfo文件夹下，然后就可以直接运行了-One with a routing algorithm Dijkstra algorithm java program, GraphMain main categories, and modify GraphFromFile graph1, graph2, graph3 current environment for their local path, the file in the src \ \ GraphInfo folder, and then you can run directly Platform: |
Size: 23552 |
Author:李伟 |
Hits:
Description: Dijkstra shortest path algorithm in order
to calculate the source to all other vertices of the shortest path length. Implementation is in Java-Dijkstra shortest path algorithm in order
to calculate the source to all other vertices of the shortest path length. Implementation is in Java Platform: |
Size: 3072 |
Author:patpat |
Hits:
Description: 算法第四版书配套大作业第四题，用迪杰斯特拉算法计算导入的文件中各城市的最短路径。(The fourth edition of the algorithm is supported by fourth major tasks, and the shortest path of each city in the imported files is calculated by Dijkstra algorithm.) Platform: |
Size: 863232 |
Author:白蘋洲 |
Hits:
Search - dijkstra algorithm in java