搜索资源列表
shortest(0)
- 各种求最短路径的方法，用于对比学习，更有效理解方法的原理-Various methods for the shortest path for comparison learning
shortest
- 本程序的功能是用遗传算法求最短路径。 可以修改顶点与顶点的权值、顶点个数、染色体的条数等去适应你的问题-The function of the program is using genetic algorithms for the shortest path. Can modify vertex and vertex weights, the number of vertices, the number of chromosomes to adapt to your question
Shortest-path
- 最短路径 Java GUI 演示 数据结构课程设计-Shortest path to the Java GUI demo data structure curriculum design
the-average-path-length
- 问题描述：平均路径长度是网络中另一个重要的特征度量，他是网络中所有节点对之间的平均最短距离。这里节点间的距离指的是从一个节点要经历的边的最小数目，其中所有节点之间的最大距离称为网络的直径。平均路径长度和直径衡量的是网络的传输性能与效率。平均路径长度的公式为 ，其中dij表示点i和j之间的最短距离（若dij不存在时，dij就不能加入，且分母要相应减1） 要求：输入邻接矩阵表示的图，计算其平均路径长度-Descr iption of the problem: the averag
triangle-in-the-tree
- 有一棵树，树上有只毛毛虫。它在这棵树上生活了很久，对它的构造了如指掌。所以它在树上从来都是走最短路，不会绕路。它还还特别喜欢三角形，所以当它在树上爬来爬去的时候总会在想，如果把刚才爬过的那几根树枝/树干锯下来，能不能从中选三根出来拼成一个三角形呢？-A tree, a tree caterpillar. It in the tree of life for a long time, it constructed well aware. In the trees, it has always be
Shortest-Path
- This the cosde for shortest path algorithm-This is the cosde for shortest path algorithm
shortest-mileage-query-procedures
- 城市间火车最短里程查询程序,实现了最短路径算法,通过自动化生成两个城市之间的最短路径方案.-Inter-city train shortest mileage query procedures to achieve the shortest path algorithm, the shortest path between two cities program generated by the automation.
The-SP-of-WH-Univers
- 利用BellmanFord算法计算武汉各高校之间最短路径。-The shortest path algorithm of Wuhan Universities based on BellmanFord
short-path
- 在dos环境下自制迷宫，用于求最短求解路径，打印出路径坐标-In the dos environment homemade maze for solving the shortest path, print out the path coordinate
path-finding
- 该MFC程序通过全国省会间最短路径的寻找演示了最短路径查找问题。-The MFC program through the national capital to find the shortest path between the shortest path to find the problem demonstrated.
shortest-path
- 网状结构中寻找最短路线。类似于A算法但不同于A算法。将所记录的步数修改为里程则可用于公路系统自动寻路。计算代码很短，仅二十余行。-Reticular formation to find the shortest route. A method similar to but different from A algorithms. The recorded number of steps can be used to modify mileage highway system automatica
shortest-path
- Dijkstra s algorithm 的實作，可輸出最短路徑。-The implementation of Dijkstra s algorithm, ouput shortest path.
path
- 利用最短路径搜索算法,实现快速寻找路由的过称。-Use the shortest path search algorithm to find the route too fast, said.
steiner-base-min-path
- 详细介绍了基于最短路径的施泰纳树问题,还有一篇是基于最小生成树的施泰纳树问题-Details of the Steiner tree problem based on the shortest path, there is a minimum spanning tree based Steiner tree problem
shortest-route-problem
- 最短路径问题的四种实现方式:广度优先、深度优先、贪心法、动态规划法、穷举法、回溯法。-Four ways to achieve the shortest path problem breadth priority greedy depth-first dynamic programming method exhaustive backtracking
shortest-path-tree
- 数字三角形最短路径，使用动态规划思想,从最低层开始计算D-Digital Triangle shortest path, using dynamic programming, counting from the lowest D
The-circuit-wiring
- 算法分析与设计电路布线问题,通过二维数组模拟一个电路布线最短路径问题-Algorithm analysis and design of the circuit wiring problem, simulating a circuit wiring through a two-dimensional array of the shortest path problem
path
- 求迷宫的最短路径,设计一个算法找一条从迷宫入口到出口的最短路径。-Find the shortest path maze design an algorithm to find a shortest path from the entrance to the maze exit.
shortest-path
- C++ program for Dijkstra s single source shortest path algorithm.The program is for adjacency matrix representation of the graph
Search-shortest-path
- 搜索最程路径，用于VB水准网计算，检查，联合水准网其它计算-Search the drive path for VB leveling network computing, check