搜索资源列表
SeqQueue
- 用队列实现迷宫算法,用c++写的,求的是最短的路径
AStar
- 如何找到一条最短的路径是程序员需要设计的算法,目前最为流行的寻路算法就是A*算法,这个就是A*算法的一个简单例子-How to find a shortest path is programmers need to design algorithms, is currently the most popular routing algorithm is the A* algorithm, this is the A* algorithm is a simple example
TravellingSalesman
- 旅行商算法,实现从加权有向图中寻找并输出最短的闭合路径-Traveling salesman algorithm, from a weighted directed graph to find and output the shortest path closure
sa_tsp
- 旅行商(TSP)问题一直以来都是一个NP难问题,旅行商问题(TSP问题)就是一销售商从n个城市中的某一城市出发,不重复地走完其余n-1个城市并回到原出发点,在所有可能的路径中求出路径长度最短的一条。本次软件设计是利用模拟退火算法解决TSP问题,通过该软件设计,对模拟退火算法和旅行商问题有个初步的认识。-Traveling Salesman (TSP) problem has always been a NP hard problem, traveling salesman problem (TS
Dijkstra
- 路径最短算法(C 语言开发完成),希望对大家有所帮助,-min topo path
tTRAA3zipr
- 旅行商算法算出全国311外城市的最短单源路径。 -The traveling salesman algorithm to calculate the shortest single-source path of National 311 outside the city.
graph
- 连通图的遍历(深度优先算法)求2个城市的最短距离,以及任何一条最短的路径-Connected graph traversal (depth-first algorithm) Find the shortest distance two cities, as well as any one shortest path
hafuman
- C++代码,目的是生成哈夫曼树。哈夫曼树又称最优二叉树,是一类带权路径长度最短的树。其构造可利用哈夫曼最早给出的哈夫曼算法来构造-C++ code is to generate Huffman trees. Huffman tree is also called the optimal two tree, is a class of weighted length of the shortest path tree. Its structure can be used to give the H