搜索资源列表
kbest
- 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
Floyd-Warshall-c-chengxi
- 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)算法结
KShortestPaths.rar
- K-shortest算法实现，采用Java语言，能根据不同的拓扑找到k条最短路径。非常经典。,K-shortest algorithm using Java language, can be found according to different topological k be the shortest path. Very classic.
KShortestPaths
- 在GRAPH中找出K條最短路徑,並且輸出到SP.txt檔中-In GRAPH find K shortest paths, and output to file SP.txt
KSP-PDF
- 前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
Dijkstra
- 求解Dijkstra 前k条最短路径，非常实用，编译已通过-Dijkstra solved before the k shortest paths
k_shortest
- 本程序的功能是寻找前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 destinatio
K_ShortestPath
- 如果你对前K条最短路径一类的问题感兴趣,那么这是不错的参考资料,希望对你有所帮助.-If you pre-K shortest paths problem for a class of interest, then this is a good reference, hope this helps.
main
- 完成了简单的A*（A star）算法 可以用于求解第K短路径-Completion of a simple A* (A star) algorithm can be used to solve the first K shortest paths
ksp
- 前k短路径,代码，功能说明，前k短路径，解析-Before the k shortest paths, code, function descr iption, the first k shortest paths, analysis etc etc
mutitarget-tracking
- 4篇文章：Multiple Object Tracking Using K-Shortest Paths Optimization；Moving target classification and tracking from real-time video；高斯混合概率假设密度滤波器在多目标跟踪中的应用；基于特征迹的密集多目标自适应视频跟踪-4papers:Multiple Object Tracking Using K-Shortest Paths Optimization；Moving ta
yen
- 一个非常经典的用于求解K条最短路径的算法，适用于求解无环情况-a very classic algorithm for k shortest paths problem with loopless
LOT_Source
- 目标跟踪第t帧图像，目标特征，噪音参数，粒子窗口 1. 在第一帧选定跟踪区域，将图像由rgb转成hsv，计算目标的特征模型； 2. 初始化粒子，用超像素计算粒子的特征； 3. 通过emd计算粒子所在位置区域特征计算与目标特征的相似度； 4. 根据emd计算粒子的权重，归一化权重，新的目标位置是所有粒子的位置和权重乘积的和； 5. 建立新目标的特征模型，计算emd。 6. 更新噪音参数； 输出：目标位置，更新参数，新的粒子窗口 -Multiple Object Tr
YenTopKShortestPathsAlg
- 求解网络中前k条最短路径，并且考虑重复遍历的情况-YenTopKShortestPathsAlg Solving the network before the k shortest paths
k_shortest
- 本程序的功能是寻找前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 n
K-shortest-Path-tracking
- 参考《Multiple Object Tracker Using K-Shortest Paths》实现的代码，使用K最短路径实现多目标追踪功能。-Reference " Multiple Object Tracker Using K-Shortest Paths" to achieve code, use the shortest path K multi-target tracking capabilities.
Yen_s_algorithm
- 利用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.
pathanddistance
- 任意两点间最短路算法 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.)