Location:
Search - paths
Search list
Description: 单源点最短路径算法的设计与实现
算法 SHORTEST-PATHS求出了v0至其它各结点的最短路径，但是没有给出这些最短路径。补充该算法，使新算法在找出这些最短路径长度的同时，也能求出路径上的结点序列。-single source shortest path algorithm design and implementation of the algorithm SHORTEST - PATHS calculated the projectile to other nodes in the shortest path, but not given them the shortest path. Added the algorithm, the new algorithm to identify the shortest path length at the same time, they can be obtained on the path node sequence.
Platform: |
Size: 891 |
Author: 胡图 |
Hits:
Description: Mobile robot tracking of pre-planned paths是国外顶尖级专家篆写的有关机器人路径规划的文章。虽然是2000年的，但是很有价值。-Mobile robot tracking of pre-planned paths top-level foreign experts to write Fragrance of the robot path planning articles. Although in 2000, but of great value.
Platform: |
Size: 231308 |
Author: 石锋 |
Hits:
Description: Shortest Paths Algorithms Theory and Experimental Evaluation
Platform: |
Size: 242974 |
Author: china_rmb@sohu.com |
Hits:
Description: Mobile robot tracking of pre-planned paths是国外顶尖级专家篆写的有关机器人路径规划的文章。虽然是2000年的，但是很有价值。-Mobile robot tracking of pre-planned paths top-level foreign experts to write Fragrance of the robot path planning articles. Although in 2000, but of great value.
Platform: |
Size: 231424 |
Author: 石锋 |
Hits:
Description: 输入任意大小的矩阵阶数n，程序将自动产生一个随机矩阵迷宫。本程序可以迅速的找到所有可能的路径，并显示之。代码中故意限制只显示最多30条路径。-arbitrary size of the input matrix order n, the program will automatically generate a random matrix maze. This program can quickly find all possible paths, and Displays. Code intentionally limited only to a maximum of 30 trails.
Platform: |
Size: 11264 |
Author: aaaa |
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: 的克斯查最短路径分析的c代码实现，可以手工输入路径矩阵并得到两点路径。-investigation of Vieques analysis of the shortest path to achieve c code can be entered manually path matrix and the following two paths.
Platform: |
Size: 86016 |
Author: 李化 |
Hits:
Description: 单源点最短路径算法的设计与实现
算法 SHORTEST-PATHS求出了v0至其它各结点的最短路径，但是没有给出这些最短路径。补充该算法，使新算法在找出这些最短路径长度的同时，也能求出路径上的结点序列。-single source shortest path algorithm design and implementation of the algorithm SHORTEST- PATHS calculated the projectile to other nodes in the shortest path, but not given them the shortest path. Added the algorithm, the new algorithm to identify the shortest path length at the same time, they can be obtained on the path node sequence.
Platform: |
Size: 1024 |
Author: 胡图 |
Hits:
Description: GraphPath
采用邻接矩阵存储图，能够找出图G中求一条从顶点i到顶点s 的所有路径。
如果遇到什么问题，请发邮件至horsewhite32@hotmail.com,笔者将不胜感激
uuhorse-GraphPath the use of adjacency matrix storage map, can find a graph G to seek from the vertex i to vertex s to all paths. If any problems, please e-mail horsewhite32@hotmail.com, I would be grateful uuhorse
Platform: |
Size: 11264 |
Author: uuhorse |
Hits:
Description: This example program uses function calls to PATHLIB4.DLL to create multi-segment paths of straight line and circular arc segments. It was created using Borland s C++ Builder. Source code is included.
Platform: |
Size: 325632 |
Author: cheer747 |
Hits:
Description: 在GRAPH中找出K條最短路徑,並且輸出到SP.txt檔中-In GRAPH find K shortest paths, and output to file SP.txt
Platform: |
Size: 1304576 |
Author: 周昊宸 |
Hits:
Description: c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
Platform: |
Size: 2048 |
Author: jazz |
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: acm算法设计：
描述：
国际象棋车可以水平或垂直的任何方在同一行或同一列的棋盘。
找到一些最短路径的一个车可以从一个角落里一个棋盘的斜对面角落。
输入：
一整数n为行数和列的棋盘。0 < n <=16
输出：
数量的最短路径。
例输入：
3或4
例输出：
6或20 -Description：
A chess rook can move horizontally or vertically to any square in the same row or in the same column of a chessboard.
Find the number of shortest paths by which a rook can move from one corner of a chessboard to the diagonally opposite corner。
Input：
a interger number n is row and column of chessboard. 0 < n <=16
Output：
the number of shortest paths.
Sample Input：
3or4
Sample Output：
6or20
Platform: |
Size: 211968 |
Author: 张波 |
Hits:
Description: 移动机器人的全路径规划算法,可以输出所有路径, vc++编写,很好,推荐-The whole mobile robot path planning algorithm, all paths can be output, vc++ to prepare, very good, recommended
Platform: |
Size: 4676608 |
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: 带权有向图的最短路径及拓补排序算法,用于计算最短路径的算法-Weighted directed graph of shortest paths and expand up sorting algorithm used to calculate the shortest path algorithm
Platform: |
Size: 5120 |
Author: steven |
Hits:
Description: A shortest path tree, in graph theory, is a subgraph of a given (possibly weighted) graph constructed so that the distance between a selected root node and all other nodes is minimal. It is a tree because if there are two paths between the root node and some vertex v (i.e. a cycle), we can delete the last edge of the longer path without increasing the distance from the root node to any node in the subgraph.
If every pair of nodes in the graph has a unique shortest path between them, then the shortest path tree is unique. This is because if a particular path from the root to some vertex is minimal, then any part of that path (from node u to node v) is a minimal path between these two nodes.
In graphs with no negative distances, Dijkstra s algorithm computes the shortest path tree, from a given vertex. In graphs with possibly negative distances, the Bellman-Ford algorithm can be used instead.
Platform: |
Size: 7168 |
Author: darulor |
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: this document is about counting paths with matlab
Platform: |
Size: 50176 |
Author: mil |
Hits:
« 12
3
4
5
6
7
8
9
10
...
39
»