搜索资源列表
SortPath
- 自己写的一个最短路径算法,WPF工程,通过设定路径的点、点的关联关系以及起始点,并最后保存,可以得到一个路径文件。程序可以读取路径文件,并算出最短路径。-To write a shortest path algorithm, WPF project, setting the path through the point, the point of the relationship as well as the starting point, and the last save, you can
path
- 两点直接绕过障碍的最短路径计算方法,vc6编写,有示意像素界面,方便初学者理解计算方法。-Two o clock direct shortest path around obstacles calculation method, vc6 preparation, a signal pixel interface, easy for beginners to understand the calculation.
tsp
- This a matlab code which deals with TSP problem. This done using ant colony algorithm. In this problem each city gets visited once and a shortest path is obtained.-This is a matlab code which deals with TSP problem. This is done using ant colony algo
a
- 根据蚁群觅食总是选择最短的路径的特点,运用蚁群算法实现选路最优化,-According to the characteristics of ant foraging always choose the shortest path routing algorithm using ant colony optimization,
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
lab2-5110379012
- 一个基于分布式系统的最短路径算法,需要手动输入每个节点到其他节点的距离-A shortest path algorithm based on distributed systems, the need to manually enter each node to other nodes in the distance
Astar
- A*算法求最短路径,数据结构里的图模型。在优化算法方面有很大用途-A* shortest path algorithm,Data structure graph model. Great use in terms of optimization algorithms
007
- 看过007系列电影的人们一定很熟悉James Bond这个著名的特工。在电影”Live and Let Die”中James Bond被一组毒品贩子捉住并且关到湖中心的一个小岛上,而湖中有很多凶猛的鳄鱼。这时James Bond做出了最惊心动魄的事情来逃脱——他跳到了最近的鳄鱼的头上,在鳄鱼还没有反应过来的时候,他又跳到了另一只鳄鱼的头上……最后他终于安全地跳到了湖岸上。 假设湖是100×100的正方形,设湖的中心在(0,0),湖的东北角的坐标是(50,50)。湖中心的圆形小岛的圆心在(0
a
- 数学建模最短路径建模源代码,经过数学建模验证过的-Mathematical modeling of the shortest path modeling source code
short-path
- pascal实现各种单源最短路算法的分析对比及代码示例-Pascal implementation of a variety of single source shortest path algorithm analysis and comparison and code examples
shortest
- 实现两个城市之间最短路径和最小花费的程序,可以作为数据结构的参考- 实现两个城市之间最短路径和最小花费的程序,可以作为数据结构的参考 Implementation of the shortest path between two cities and the minimum cost of the program, can be used as a reference for the data structure
A-modified-pulse-coupled
- A modified pulse coupled neural network for shortest-path problem
4.2
- 基于dijkstra和广度搜索的加权有向图有必经点的点对点的最短路径算法,路径必须经过要求的必经点,且不成环。 该算法采用了一种自适应调整的方法,经过多次迭代,使解收敛。 但只是寻找了一个略优的可行解(每次迭代都基于贪婪算法寻找),不能保证最优解。而且如果图过于稀疏,因为收敛速度过快,可能导致问题无解(收敛于一个局部最优解,没有经过所有点)。 解决相对稠密的图(每个点的平均出入度4以上),表现良好。 备注:里面有一个QT的工程,可以直接打开(源码里没用QT的库)-Weigh
A-star
- A-star算法求最短路径。 公式表示为: f(n) g(n)+h(n), 其中 f(n) 是从初始状态经由状态n到目标状态的代价估计, g(n) 是在状态空间中从初始状态到状态n的实际代价, h(n) 是从状态n到目标状态的最佳路径的估计代价。-A-star algorithm for the shortest path. Formula is expressed as: f (n) g (n)+h (n), where f (n) the initial s
Graphics-A-STAR-algorithm-master
- A星寻路算法,实现图形中路径的搜索和规划最短路径的功能。-A star pathfinding algorithm, search functions and planning the shortest path in the graph path.
dijkstra_short-path-algo
- Dijkstra s algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.[1][2]
the shortest path program in graph theory
- 图论算法在计算机科学中扮演着很重要的角色,它提供了对很多问题都有效的一种简单而系统的建模方式。很多问题都可以转化为图论问题,然后用图论的基本算法加以解决。遗传算法是解优化问题的有效算法,而并行遗传算法是遗传算法研究中的一个重要方向,受到了研究人员的高度重视。(Graph theory plays an important role in computer science. It provides a simple and systematic modeling method for many p
floyd
- Floyd算法又称为弗洛伊德算法、插点法,是一种用于寻找给定的加权图中顶点间最短路径的算法。(Floyd algorithm, also known as plug-in method, is an algorithm for finding the shortest path between vertices in a given weighted graph.)
Asuanfa
- 建立一个30*30带障碍的小地图,包括起点和终点。寻找最短路径。(Create a small map of 30*30 with obstacles, including starting and ending points. Find the shortest path.)
A Solution to TSP with GA
- 利用遗传算法解决最短路径问题(商旅问题)(Using genetic algorithm to solve the shortest path problem (business travel problem))