Description: k Shortest Paths
David Eppstein s method
ICTCLAS研究学习组
http://groups.google.com/group/ictclas?msg=subscribe-k Shortest Paths David Eppstein's method IC TCLAS Studies Group http : / / groups.google.com / group / sub ictclas msg = scribe Platform: |
Size: 19942 |
Author:Jian Ye |
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的连通情况。
Platform: |
Size: 3567 |
Author:江晨 |
Hits:
Description: k Shortest Paths
David Eppstein s method
ICTCLAS研究学习组
http://groups.google.com/group/ictclas?msg=subscribe-k Shortest Paths David Eppstein's method IC TCLAS Studies Group http :// groups.google.com/group/sub ictclas msg = scribe Platform: |
Size: 19456 |
Author:Jian Ye |
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: K-shortest算法实现，采用Java语言，能根据不同的拓扑找到k条最短路径。非常经典。-K-shortest algorithm using Java language, can be found according to different topological k be the shortest path. Very classic. Platform: |
Size: 49152 |
Author:wei |
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: 本程序的功能是寻找前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: 完成了简单的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: 前k短路径,代码，功能说明，前k短路径，解析-Before the k shortest paths, code, function description, the first k shortest paths, analysis etc etc Platform: |
Size: 13312 |
Author:xbq |
Hits:
Description: 一个非常经典的用于求解K条最短路径的算法，适用于求解无环情况-a very classic algorithm for k shortest paths problem with loopless Platform: |
Size: 2238464 |
Author:李建伏 |
Hits:
Description: 求解网络中前k条最短路径，并且考虑重复遍历的情况-YenTopKShortestPathsAlg Solving the network before the k shortest paths Platform: |
Size: 2048 |
Author:Peng LI |
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:gefopti |
Hits:
Description: 利用YEN算法求前K条最短路径，有TEST的函数对测试网络进行求解，利用时更换输入网络即可。-YEN algorithm for the use of the former K shortest paths with TEST function to test network to solve, enter the network to replace the use of time. Platform: |
Size: 12288 |
Author:111 |
Hits:
Description: 任意两点间最短路算法
Warshall-Floyd算法思想，最短距离矩阵+任意给定两顶点的最短路所包含顶点。(The shortest path algorithm between any two points
The idea of Warshall-Floyd algorithm, the shortest distance matrix + the shortest path contained by any given two vertex is the vertex.) Platform: |
Size: 2048 |
Author:SARAH寒 |
Hits:
Search - k shortest paths