Location:
Search - SHORTEST-PATHS
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: 1720320 |
Author: zx |
Hits:
Description: 具有图形化界面的一个路由模拟程序。路由算法为Dijkstra算法。具有求出图中任意节点间所有最短路径以及最短路径子图的功能。这是一个点对点(S-T)Dijkstra算法的改进。用于求两点间的所有最短路径。-graphical interface with the simulation of a routing procedures. Routing algorithm Dijkstra algorithm. With map obtained arbitrary nodes all the shortest paths and shortest path graph of the function. This is a peer-to-peer (S-T) Dijkstra algorithm improvements. Seeking 2:00 for all the shortest path.
Platform: |
Size: 3072 |
Author: 阎一 |
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: 旅行商算法算出全国31外城市的最短单源路径。-traveling salesman algorithm calculates the country's 31 cities outside the single source shortest paths.
Platform: |
Size: 2048 |
Author: qw |
Hits:
Description:
Platform: |
Size: 1024 |
Author: ewook |
Hits:
Description: Floyd-Warshall算法描述
1)适用范围：
a)APSP(All Pairs Shortest Paths)
b)稠密图效果最佳
c)边权可正可负
2)算法描述：
a)初始化：dis[u,v]=w[u,v]
b)For k:=1 to n
For i:=1 to n
For j:=1 to n
If dis[i,j]>dis[i,k]+dis[k,j] Then
Dis[I,j]:=dis[I,k]+dis[k,j]
c)算法结束：dis即为所有点对的最短路径矩阵
3)算法小结：此算法简单有效，由于三重循环结构紧凑，对于稠密图，效率要高于执行|V|次Dijkstra算法。时间复杂度O(n^3)。
考虑下列变形：如(I,j)∈E则dis[I,j]初始为1,else初始为0，这样的Floyd算法最后的最短路径矩阵即成为一个判断I,j是否有通路的矩阵。更简单的，我们可以把dis设成boolean类型，则每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”来代替算法描述中的蓝色部分，可以更直观地得到I,j的连通情况。
-err
Platform: |
Size: 3072 |
Author: 江晨 |
Hits:
Description: There are many algorithms that can be applied to graphs. Many of these are actually used in the real world,
such as Dijkstra’s algorithm to find shortest paths. We will discuss a few here.-有很多算法，可用于图形。其中许多是实际使用在现实世界中，
如迪杰斯特拉算法寻找最短路径。将在这里讨论几个算法。
Platform: |
Size: 669696 |
Author: anton shieh |
Hits:
Description: For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined
Platform: |
Size: 52224 |
Author: vvvvv |
Hits:
Description: 前k条最短路径（KSP）算法在国内鲜有研究，本压缩包中文献整合了自1971年此问题被提出后几十年来的论文共25篇。
其中以Martin先生的删除（Delelte）算法与Yen先生的背离（Devation）算法为主。
其中所有文献均来自网络。含有两篇中文文章以及23篇英文文章。
算法的复杂度基本控制于O(logn)内-Pre-k shortest paths (KSP) algorithm in the domestic few studies in the literature in this compressed package integration since 1971, this issue has been moved for several decades a total of 25 papers. Among them, Mr. Martin removed (Delelte) algorithm and Mr. Yen departure (Devation) algorithm is based. In which all documents are from the network. Contains two Chinese articles and 23 articles in English. The complexity of basic control algorithms in O (logn) in
Platform: |
Size: 8790016 |
Author: Lee |
Hits:
Description: Shortest Paths Algorithms
Platform: |
Size: 2048 |
Author: OluS |
Hits:
Description: 算法实验 其中包括 N后问题 最短路径 哈弗曼编码 归并排序-Algorithm after the experiment including the N shortest paths problem Havermann code mergesort
Platform: |
Size: 4440064 |
Author: 边缘细线 |
Hits:
Description: 经典算法书(中文版)。这一套算法系列书介绍了当今最重要的算法，共分3卷，这是第2卷（第五部分），集中讲解图算法。本书共有6章（第17章～第22章）。第17章详细讨论图性质和类型，第18章~第22章分别讲解图搜索、有向图和DAG、最小生成树、最短路径以及网络流。书中提供了用C语言描述的完整算法源程序，并且配有丰富的插图和练习。-Algorithms in C, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick s thoroughly revised and rewritten series. The first book, Parts 1-4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book s expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment.
Coverage includes:
* A complete overview of graph properties and types
* Diagraphs and DAGs
* Minimum spanning trees
* Shortest paths
* Network flows
* Diagrams, sample C code, and detailed algorithm descriptions
Platform: |
Size: 13904896 |
Author: wang |
Hits:
Description: ICTCLAS分词的总体流程包括：1）初步分词；2）词性标注；3）人名、地名识别；4）重新分词；5）重新词性标注这五步。就第一步分词而言，又细分成：1）原子切分；2）找出原子之间所有可能的组词方案；3）N-最短路径中文词语粗分三步。
在所有内容中，词典库的读取是最基本的功能。ICTCLAS中词典存放在Data目录中，常用的词典包括coreDict.dct（词典库）、BigramDict.dct（词与词间的关联库）、nr.dct（人名库）、ns.dct（地名库）、tr.dct（翻译人名库），它们的文件格式是完全相同的，都使用CDictionary类进行解析。如果想深入了解ICTCLAS词典结构，可以参考sinboy的《ICTCLAS分词系统研究（二）--词典结构》一文，详细介绍了词典结构。
-ICTCLAS word of the overall process include: 1) initial segmentation 2) POS tagging 3) names, places identification 4) to re-word 5) This five-step re-speech tagging. The first word, the thin, divided into: 1) atom splitting 2) to identify all the possible atomic set of words between the program 3) N-shortest paths Chinese words rough three steps.
Platform: |
Size: 1965056 |
Author: ounata |
Hits:
Description: 求解Dijkstra 前k条最短路径，非常实用，编译已通过-Dijkstra solved before the k shortest paths
Platform: |
Size: 1024 |
Author: 花无缺 |
Hits:
Description: 本程序的功能是寻找前k条最短路径，在DOS窗口中先输出了网络节点的拓扑结构，然后输入源节点与目的节点，输出最短路径以及前k条最短路径。
-The functionality of the program is to find pre-k shortest paths. First output in the DOS window of the topology of the network node, and then enter the source node and destination node, the output includes pre-k shortest paths and the shortest path.
Platform: |
Size: 2048 |
Author: shenjian |
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: 迪杰斯特拉算法求最短路径，经典的求解最短路径算法等-Dijstrala algorithm solve the shortest—paths problems
Platform: |
Size: 153600 |
Author: 李宜鹏 |
Hits:
Description: Floyd算法适用于APSP(All Pairs Shortest Paths)，-APSP(All Pairs Shortest Paths)，
Platform: |
Size: 4096 |
Author: 张三峰 |
Hits:
Description: 完成了简单的A*（A star）算法 可以用于求解第K短路径-Completion of a simple A* (A star) algorithm can be used to solve the first K shortest paths
Platform: |
Size: 1024 |
Author: 钟洪盛 |
Hits:
Description: 图论算法实现，含树，欧拉圈，霍夫曼编码，图的连通性，着色树，最短路径等，且采用加载皮肤界面，界面美观-Graph algorithms, including trees, Euler circles, Huffman coding, graph connectivity, coloring trees, shortest paths, and the interface with loads of skin, beautiful interface
Platform: |
Size: 1144832 |
Author: zc |
Hits: