搜索资源列表
graphtheory
- 5个关于图论的算法 包括K短路问题 NLOGN问题 二分图匹配问题 费用流问题 最大流问题-5 on the graph theory algorithms, including K shortest path problem NLOGN problems cost bipartite matching maximum flow flow
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
kspaddc
- 这是一个求解k条最短路径路由的算法程序，已经调试通过。-This is a solution of the k shortest path routing algorithm, has been through debugging.
TheKstPath
- 从原始点到顶点j的第K条最短路是由原始点到顶点i(i是j的相邻顶点,最短路从i指向j)的第K条最短路-To vertex j from the original point of the first K shortest path from the original point to the vertex i (i is adjacent to vertex j, the shortest path from i to point j) of Article K shortest
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
graehl
- K最短路径eppstein算法的C语言实现-k shortest path eppstein algorithm
yen
- 一个非常经典的用于求解K条最短路径的算法，适用于求解无环情况-a very classic algorithm for k shortest paths problem with loopless
the_k_shortest_path
- 第k短路算法，用A*算法和优先队列实现。查找任意两点间的第k短路，时间复杂度O(NLOGN)-K-shortest path algorithm, A* algorithm and priority queue. Find the first k short circuit between any two points, the time complexity of O (NLOGN)
Survivable
- 实现了yen的K最短路径， 无环，写的比较简单， 一看就懂-Yen K-shortest path, acyclic write relatively simple to understand at a glance
KDUANLU
- 单亲遗传算法求解k短路问题（KSP）--原创算法-Single Parent Genetic Algorithm k shortest path problem (KSP)- Original algorithm
ksp-1.0
- 前k短路徑 martin所開發的前k短路徑算法程式-k shortest path
kshortestpaths_2.1
- 一个k最短路径算法,用C++实现的，很好用-A k shortest path algorithm
ShortestPathWithAStar
- K-shortest path mining with c-K-shortest path mining with c++
LOT_Source
- 目标跟踪第t帧图像，目标特征，噪音参数，粒子窗口 1. 在第一帧选定跟踪区域，将图像由rgb转成hsv，计算目标的特征模型； 2. 初始化粒子，用超像素计算粒子的特征； 3. 通过emd计算粒子所在位置区域特征计算与目标特征的相似度； 4. 根据emd计算粒子的权重，归一化权重，新的目标位置是所有粒子的位置和权重乘积的和； 5. 建立新目标的特征模型，计算emd。 6. 更新噪音参数； 输出：目标位置，更新参数，新的粒子窗口 -Multiple Object Tr
graphkshortestpaths
- Yen的k最短路径算法 KSP 实现K-shortest path路径选择-Yen' s k shortest path algorithm KSP
YenTopKShortestPathsAlg
- 求解网络中前k条最短路径，并且考虑重复遍历的情况-YenTopKShortestPathsAlg Solving the network before the k shortest paths
ksp
- 一组修正过的k-shortest path算法实现代码-some revised k-shortest path algorithm realization code
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