搜索资源列表
uuiooo
- 图的算法程序.最小生成树,最短路径等问题-map algorithm procedures. Minimum spanning tree, such as the shortest path problem
5.3findClosest
- 最短路径查询 用户可以随便的查询出其最想要达到的地点-shortest path query users can easily inquiries its most desired locations
DivConquer
- 算法实验:1 分治法在数值问题中的应用 ——最近点对问题 2 减治法在组合问题中的应用——8枚硬币问题 3 变治法在排序问题中的应用——堆排序 4 动态规划法在图问题中的应用——全源最短路径问题 -Algorithm experiment: 1 divided numerical problems in the application- the nearest point to question 2 by governance problems in the applicati
AStar
- A星算法的经典模型，实现了寻找最短路径，并且用按钮实现了这些使用的方法-A classic model of satellite algorithm to realize the search for the shortest path, and used the button the methods used to achieve these
Abstract
- Projects Abstract HRMS, Shortest path etc
floyd
- Floyd求解最短路径问题其中运行结果直接可求解出路径-Floyd solve the shortest path problem can be solved in which the results from a direct path
Floyd_Dijkstra
- Find the shortest path with Dijkstra algorithm, Floyd algorithm
DJshortpath
- 计算最短路径，属于图于网络知识，仅供参考，希望读者慎用！-Calculate the shortest path belonging to the network knowledge, and for reference only hope that readers used with caution!
Ant-colony-algorithm
- 利用算法求解最短路径,并且可以实现，学校建筑布局的显示-Using the algorithm to solve the shortest path，the school building layout can de displayed
code
- code for shortest path graph with c-code for shortest path graph with c++
Huffman-algorithm-code
- 哈夫曼树是一种树形结构，用哈夫曼树的方法解编程题的算法就叫做哈夫曼算法。树并不是指植物，而是一种数据结构，因为其存放方式颇有点象一棵树有树叉因而称为树。 最简哈夫曼树是由德国数学家冯。哈夫曼 发现的，此树的特点就是引出的路程最短。 概念理解：1.路径 从树中一个节点到另一个节点之间的分支构成这两个节点之间的路径。2.路径长度 路径上的分支数目称作路径长度。-Huffman tree is a tree structure, Huffman tree algorithm method to sol
Maze154056272003
- maze algorithm to found shortest path
dijkstra
- 基于图论求解最短路径，经典dijkstra算法，通用版-Based on the graph theory to solve the shortest path, classical dijkstra algorithm, general version
RO_TP1
- contains the source code of two famous algorithmes Dijistkra (shortest path) and Bellman, and degree of a graph plus detection of path between two peak and if there is any circuit in the graph