搜索资源列表
最短路径－java
- 一个java 编写的最短路径算法实现，用applet实现，很形象-prepared in a shortest path algorithm, using applet achieve very image
Dijkstra算法是寻找图中最短路径的基本算法
- Dijkstra算法是寻找图中最短路径的基本算法，这里是用java实现-Dijkstra s algorithm is to find the shortest path graph of the basic algorithm, to achieve here is to use java
tuixiangzi
- 推箱子游戏 项目简述：按五维键▼▲左、右移动搬运工，按鼠标可以通过最短路径让搬运工到达光标所在地 -Sokoban Game Project Descr iption: According to five-dimensional ▼ ▲ key to the left and right moving porters, according to the mouse through the shortest path to reach the cursor location as port
grapher
- 深度优先，广度优先，最短路径，最小生成树的图形演示以及源代码-Depth-first, breadth-first, shortest path, minimum spanning tree, as well as graphical presentation source
SHORSTPATH
- 这是一份实验报告，里面含有JAVA 实现的最短路径的源码。论文中讨论的最短路径的发展和各个算法的局限性。并对最短路径存在的一些问题提出思考！-This is a test report, which contains the shortest path to achieve JAVA source code. Papers discussed in the shortest path algorithm development and the various limitations. The s
LogFac_Exp_1
- 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 s
dijkstra-java
- Dijkstra算法是典型的最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。Dijkstra算法是一种逐步搜索算法，通过为每个顶点n保留目前为止所找到的从m到n的最短路径来工作的。 -Dijkstra algorithm is a typical example of the most short-circuit algorithm, used
Algorithm
- java 实现的一些算法： 赛选法求素数，最短路径（dijkstra，floyd），线段树，LCD，LCM-java implementation of a number of algorithms: tournament selection method Primes, the shortest path (dijkstra, floyd), segment tree, LCD, LCM
Dijkstra
- 用java实现的Dijkstra算法，当用户输入起始点和终点时，会自动产生两点之间的最短路径-Using java implementation of the Dijkstra algorithm, when the user enters the starting point and end point, it will automatically generate the shortest path between two points
ShortestPath_Djk-complexnetworks
- 复杂网络最短路径算法，详细而有条理，很有帮助-Complex network shortest path algorithm, detailed and structured, very helpful
bfs-src
- 1.程序基于java语言。运行要求java运行环境。即就使jdk1.2以上。否则程序无法运行。 2.程序中读图时，可以选择读有向图还是无向图。 3.本程序为一个图的综合运行环境。提供了图的各种操作。包括读图，DFS判断图中是否存在 环路，BFS全局访问，两点之间的最短路径，屏幕清空。并且跟踪说明了图的各种操作的 过程。 4.程序可以多次的读图，进行图的各种操作。点击面板上的各种按钮就可以进行各种操作。-1. Procedures based on the java language.
JAVA
- 在城市智能交通中,经常会用到最短路径的问题,比如找最佳的行车路线等,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
Floyd
- 采用了动态规划法即FLOYD算法利用矩阵求多源最短路径的JAVA实现-Using a dynamic programming method that is FLOYD algorithm uses matrix Multi-source shortest path to achieve JAVA
Noname1
- 用无向网表示你所在学校的校园景点平面图，图中定点表示主要景点，存放 景点的编号、名称、简介等信息。要求能够回答有关景点介绍、游览路经等问题。 要求：(1)查询各景点相关信息； (2)查询图中任意两个景点的最短路径。 (3)查询图中任意两个景点的所有路径。 --Free to the net means that the school campus attractions in your plans, the figure fixed-point of their main a
Map
- 基于Java的最短路径连通图 用于一般大学计算机专业数据结构课设-Java-based shortest-path connected graphs for general university computer science courses based data structure
simulated_annealing
- 人工智能问题，通过模拟退火算法实现旅行商问题，随机产生31个地址，计算旅行商走完的最短路径，并绘制路线图。作者：陈华昌-Using simulated annealing algorithm achive "traveler" problem.
suanfa
- 里面包含了各种常用算法的java实现，如八皇后问题，合唱队问题，找零钱问题，最短路径问题等-Which contains a variety of commonly used algorithm java implementation, such as the eight queens problem, chorus problems, to find small change problem, the shortest path problem, etc.
shortestpath
- 求最短路径的好例子，日本人写的，鬼子还真是有一手-Good example for computing shortest path.
xiaoyuandaoyouxitong
- 用java语言实现可视化的校园导游系统，包括景点介绍和最短路径等。-Visualization using java language campus tour guide system, including the introduction and the shortest path and other attractions.
最短路径
- 最短路劲的使用，基于java的可视化最短路径开发(The use of the shortest road, based on java visualization of the shortest path development)