搜索资源列表
path_sample
- 用JAVA写的最短路径算法(在GIS开发尤其是WEBGIS开发中非常有用！)-using Java to write the shortest path algorithm (especially in the development of GIS development of WEBGIS is very useful!)
AnalysePolluter
- 本程序是在eclipse3.2环境下结合ESRI公司的AE组件进行二次开发的GIS应用程序—污染源分析系统。程序的界面是利用java的SWING和AWT组件设计的，后台的数据分别放在SQL2005和SDE数据引擎中。程序主要的功能包括：地图漫游，鹰眼，地图的操作，属性表显示，索引，空间查询，最短路径设计，污染源分析等等。-This procedure is in eclipse3.2 environment with ESRI' s AE components for secondary
tsp
- 旅行商问题的源代码及其说明。给出空间中给定n个点，画一条简单路径，包括所有的点，使得路径最短-Traveling Salesman Problem and its descr iption of the source code. Given space in a given n points, draw a simple path, including all the points, making the shortest path
shortestpaths
- 一个不错的源码，关于分支限界求单源最短路径,java，推荐给大家共享，希望能相互学习-A good source, on the branch and bound for single-source shortest path, java, recommend to all to share, hoping to learn from each other
MiniPass
- 自己上学编的基于Dijkstra的最短路径&最大流量java源码，图论部分用Rot语言描述，带junit测试程序-Navigation finds the shortest (and/or) path between points on a map using the Dijkstra algorithm
tsp
- 旅行商问题的源代码及其说明。给出空间中给定n个点，画一条简单路径，包括所有的点，使得路径最短-Traveling Salesman Problem and its descr iption of the source code. Given space in a given n points, draw a simple path, including all the points, making the shortest path
TSP_DESK
- TSP两种算法求解，一种是遍历所有可能路径求出最短，一种是采用模拟退火算法-TSP
SimulateAnnealing
- 用于实现TSP的模拟退火实验 JAVA编写 适合初学 求解144城市最短路径-Simulated Annealing for the TSP to achieve the preparation of experimental JAVA 144 cities for beginners to solve the shortest path
shortestPath
- 用Java语言实现的用分支限界法解决单源最短路径问题的算法-An implementation of single source shortest path problem with Java language based on branch and bound method
Shortest-path
- 最短路径 Java GUI 演示 数据结构课程设计-Shortest path to the Java GUI demo data structure curriculum design
basicanalysis
- 通过使用邻接表存储实现的有向图最短路径算法，java版本-最短路径实现 Java 版本
dijkstra
- JAVA编写的Dijkstra算法，可用于求解最短路径。-Dijkstra by using java which can be applied to solve the shortest path
FloydInGraph
- 利用java实现弗洛伊德算法，求无向图中两个节点的最短路径长度。-Java use Floyd algorithm for the undirected graph shortest path between two nodes in length.
fire_emble
- java实现人工智能算法：通过将目标物放入地图上一个位置上，程序能够使用最短路径找到此目标物。配有界面且能够随意放置目标物（包括添加障碍物等）-Java implementation of artificial intelligence algorithm: the target object into the map the last position, the program can use the shortest path to find the target. Equipped wit
WebApplication1
- 简单的基于AO与C＃.NET的实验例子，实现了图层加载、最短路径查询等功能。 [c#_pattern.rar] - 23个设计模式是史上公认的经典，实例代码目前多是JAVA版的，现在上传个C＃版的-Simple experiments based AO and C# .NET example, to achieve a layer loaded, the shortest path query. [C# _pattern.rar]- 23 was designed to be recogn
diijestrala
- 最短路径算法:用java 编写的最短路径算法，里面有详细的实现过程，可以很容易看懂-Dijsktra shortest way to find the shortest way one verise to another,way one verise to another
My_Ant_Algorithm
- 蚁群算法，Java程序，面向对象思想，求最短路径-Ant colony algorithm, a Java program, the object-oriented thought, seek the shortest path
lvxingshang
- JAVA实现旅行商问题，有简单的可视化界面 有N个城市，要求从其中某个问题出发，唯一遍历所有城市，再回到出发的城市，求最短的路线。使用模拟退火算法可以比较快的求出TSP的一条近似最优路径。-JAVA traveling salesman problem, a simple visual interface There are N cities, which to ask a question, the only way to traverse all cities, and then
huffman
- 哈夫曼（Huffman）树又称最优二叉树或最优搜索树，是一种带权路径长度最短的二叉树。在许多应用中，常常赋给树中结点一个有某种意义的实数，称此实数为该结点的权。从树根结点到该结点之间的路径长度与该结点上权的乘积称为结点的带权路径长度(WPL)，树中所有叶子结点的带权路径长度之和称为该树的带权路径长度.(The Huffman (Huffman) tree, also known as the optimal two - fork tree or the optimal search tree,