Location:
Search - paths problem
Search list
Description: A*算法解决找路径的问题，对于特定的图形，按照距离最短的评估函数，来解决寻优问题-A * algorithm to find paths to solve the problems that specific graphics, in accordance with the shortest distance from the assessment function, to solve the optimization problem
Platform: |
Size: 23096 |
Author: zx |
Hits:
Description: A*算法解决找路径的问题，对于特定的图形，按照距离最短的评估函数，来解决寻优问题-A* algorithm to find paths to solve the problems that specific graphics, in accordance with the shortest distance from the assessment function, to solve the optimization problem
Platform: |
Size: 1720320 |
Author: zx |
Hits:
Description: 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。
-Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel business to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum.
Platform: |
Size: 1231872 |
Author: 吴昆 |
Hits:
Description: 通过智能agent间的协作，模拟解决吸尘器吸地板灰尘的问题，达到在最短时间内完成最好的洗尘效果。-Intelligent agent collaboration, simulation of a vacuum cleaner to solve the problem of dust suction floor to be completed in the shortest possible time effects of the best welcome home.
Platform: |
Size: 197632 |
Author: lh |
Hits:
Description: TSP问题的动态规划求解。问题描述：旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -TSP dynamic programming to solve the problem. Description of the problem: traveling salesman problem, namely TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel businessmen to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum.
Platform: |
Size: 1045504 |
Author: 黄艺敏 |
Hits:
Description: 旅行商问题（TSP）是组合优化领域的一个典型的、易于描述却难以处理的NP完全难题，其可能的路径数目与城市数目是呈指数型增长的，求解非常困难。-Traveling Salesman Problem (TSP) is the field of combinatorial optimization of a typical, easy to describe but difficult to deal with NP-complete problems, the number of possible paths is an exponential number of urban growth, and to solve very difficult.
Platform: |
Size: 260096 |
Author: 黄艺敏 |
Hits:
Description: Dijkstra算法与Floyd算法的matlab实现，以求解最短路问题-Dijkstra algorithm and Floyd algorithm matlab realize in order to solve the shortest path problem
Platform: |
Size: 2048 |
Author: 姚益武 |
Hits:
Description: 探询路径
问题的提出：编写程序，输出下图的0至n（1<=n&&n>=9）的所有路径。
该题的核心是找出满足一定规律的递归条件，从而设计出递归算法。仔细分析不难发现规律：
0至n的路径由0至n-1的路径，加上n-1至n的路径，以及0至n-2的路径，加上n-2至n的路径这
两部分组成。即欲找0至n的路径，可以转化为找0至n-1及0至n-2的路径，这就可建立递归。-Explore the path
Of the problem: the preparation of procedures, under the map output from 0 to n (1 <= n & & n> = 9) of all paths.
The core of the problem is to find out the law to meet certain conditions recursive, so the design of recursive algorithm. Careful analysis of the law is not difficult to find:
The path from 0 to n from 0 to n-1 of the path, together with n-1 to n path, as well as 0 to n-2 path, together with n-2 to n the path of this
Composed of two parts.to find the path from 0 to n, can be transformed into looking for 0 to n-1 and 0 to n-2 path, which can establish a recursion.
Platform: |
Size: 6144 |
Author: 颜昌文 |
Hits:
Description: 模拟退火和对称
*欧几里德旅行商问题。
*
*为基础的解决办法的本地搜索启发式
*非过境道路和近邻
-/*
* Simulated annealing and the Symetric
* Euclidian Traveling Salesman Problem.
*
* Solution based on local search heuristics for
* non-crossing paths and nearest neighbors
*
* Storage Requirements: n^2+4n ints
*
* Problem: given the coordinates of n cities in the plane, find a
* permutation pi_1, pi_2, ..., pi_n of 1, 2, ..., n that minimizes
* sum for 1<=i<n D(pi_i,pi_i+1), where D(i,j) is the euclidian
* distance between cities i and j
*
* Note: with n cities, there is (n-1)!/2 possible tours.
* factorial(10)=3628800 factorial(50)=3E+64 factorial(150)=5.7E+262
* If we could check one tour per clock cycle on a 100 MHZ computer, we
* would still need to wait approximately 10^236 times the age of the
* universe to explore all tours for 150 cities.
*
* gcc-O4-o tsp tsp.c-lm tsp | ghostview-
*
* Usage: tsp [-v] [n=dd] [s=dd] [filename]
* -v : verbose
* n= : nb of cities (cities generated randomly on E^2
Platform: |
Size: 86016 |
Author: 孙博 |
Hits:
Description: 算法实验 其中包括 N后问题 最短路径 哈弗曼编码 归并排序-Algorithm after the experiment including the N shortest paths problem Havermann code mergesort
Platform: |
Size: 4440064 |
Author: 边缘细线 |
Hits:
Description: 有向循环图迷宫问题求解，普通迷宫问题要求找出从迷宫入口到出口的所有路径，而此次研究的主要内容是找出有向循环图中的回路（即容易造成流程死循环的地方），消除循环并找出死结点。与此同时，找出死结点后，其他顶点最终都能够到达迷宫的出口。在实际审计过程中的应用意义则为：确定审计工作在哪一个负责部门完成后，是无法继续向其他负责部门传递审计工作直到完成整个审计流程的。-Directed cyclic graph maze problem solving, general maze problem requires to find the entrance to the export from the maze of all the paths, but this study is to identify the main contents of the loop to loop graph (that is likely to cause death cycle process where) to eliminate the loop and find the knot points. At the same time, find the knot points, the other vertices are eventually able to reach the maze exit. In the real significance of the audit process was: to determine the audit department in charge after the completion of which it is impossible to transfer to other heads of departments to complete the audit until the audit process.
Platform: |
Size: 1024 |
Author: wenwen |
Hits:
Description: 利用遗传算法求解旅行商问题
旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling salesman problem using genetic algorithm traveling salesman problem, namely, the problem TSP (Travelling Salesman Problem) is one of the famous field of mathematics. Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.
Platform: |
Size: 7168 |
Author: yanzhongyuan |
Hits:
Description: 如果你对前K条最短路径一类的问题感兴趣,那么这是不错的参考资料,希望对你有所帮助.-If you pre-K shortest paths problem for a class of interest, then this is a good reference, hope this helps.
Platform: |
Size: 2978816 |
Author: 花无缺 |
Hits:
Description: The Bellman–Ford algorithm computes single-source shortest paths in a weighted digraph. For graphs with only non-negative edge weights, the faster Dijkstra s algorithm also solves the problem.
Platform: |
Size: 1024 |
Author: ww |
Hits:
Description: 实现迷宫问题的求解：以一个m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。-Achieve maze problem solving: a long-m* n matrix that maze, 0 and 1, respectively, in the maze of paths and obstacles. Design a program, for any set of the maze, find a pathway from the entrance to the exit, or come to the conclusion there is no path.
Platform: |
Size: 2048 |
Author: GUM |
Hits:
Description: 最短路径问题。两个点A与B之间有多条路，从A到B有多条方案。求A到B的最短路径-The shortest path problem.There are several paths from point A to B.Now we want to know which path is the shortest.Ihis program can help us desolve the Transportation problem
Platform: |
Size: 4096 |
Author: zhangyue |
Hits:
Description: 一个非常经典的用于求解K条最短路径的算法，适用于求解无环情况-a very classic algorithm for k shortest paths problem with loopless
Platform: |
Size: 2238464 |
Author: 李建伏 |
Hits:
Description: 编译环境MFC，实现一个迷宫问题：
任意确定一个迷宫的规模和形态，用非递归的方法走出迷宫，并输出至少一条通路的路径。
-Compiler environment MFC, the realization of a maze problem: determining a maze of arbitrary size and shape, with a non-recursive way out of the maze, and outputs at least one channel path.
Platform: |
Size: 2109440 |
Author: dahaideerzi0 |
Hits:
Description: C++源码，控制台实现数据结构中的迷宫问题，可给出所有路径的路径图，路径总数和最短路径图-Using VC++ to realize the maze problem.It can figure out all paths and the shortest path.
Platform: |
Size: 4312064 |
Author: 苗航 |
Hits:
Description: problem to calculate some formula between two inputs that entered from the user
Platform: |
Size: 32768 |
Author: fahmy |
Hits: