搜索资源列表
import java
- 比较牛的最短路径源代码。大家共享一下,呵呵。我的电子邮箱欢迎:Lyl@szzfcg.cn-the shortest path source code. Share what, huh. I welcome e-mail : Lyl@szzfcg.cn
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
Dijkstra-althorim
- 这是一个基于JAVA实现的点对点(S-T)Dijkstra算法的改进。用于求两点间的所有最短路径。-this si a althorim named Dijkstra used for router
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
dijkstra
- JAVA编写的Dijkstra算法,可用于求解最短路径。-Dijkstra by using java which can be applied to solve the shortest path
最短路径
- 最短路劲的使用,基于java的可视化最短路径开发(The use of the shortest road, based on java visualization of the shortest path development)
huffman
- 哈夫曼(Huffman)树又称最优二叉树或最优搜索树,是一种带权路径长度最短的二叉树。在许多应用中,常常赋给树中结点一个有某种意义的实数,称此实数为该结点的权。从树根结点到该结点之间的路径长度与该结点上权的乘积称为结点的带权路径长度(WPL),树中所有叶子结点的带权路径长度之和称为该树的带权路径长度.(The Huffman (Huffman) tree, also known as the optimal two - fork tree or the optimal search tree,