Search - shortest path

Search - shortest path - List

[Special Effects] Project DL : 0: 寻找最短路径的，默认为实际图上的距离，可以设定距离，然后可以寻找出两点间最短的距离-Find the shortest path, the default for the actual map distance, you can set the distance, and then be able to find out the shortest distance between two points
Date : 2025-12-31 Size : 3.72mb User : visan
[Special Effects] Matlab__zuiduanheciduanlu DL : 0: 属于图像处理的基本算法，用MATLAB实现了最短路径和次短路径的算法。-Belong to the basic algorithm for image processing, using MATLAB to achieve the shortest path and the second short-path algorithms.
Date : 2025-12-31 Size : 7kb User : zoe
[Special Effects] Astar DL : 0: 代码很好的实现了基于a-star的最短路径寻找算法，并可以对寻找的路径有一个限制-Code is a good realization of a-star-based shortest path search algorithms, and can find the path there is a limit
Date : 2025-12-31 Size : 20kb User : 赵红丽
[Special Effects] snake2 DL : 0: 程序中用opencv进行图像处理，通过虚拟键盘控制方向玩文件夹内的贪吃蛇游戏，实现最短路径规划及撞到墙或者撞到自身时的方向控制。-Opencv image processing procedures used by the direction of the virtual keyboard control to play the game Snake within a folder, to achieve the shortest path planning and hit the wall or hit when the direction of their own control.
Date : 2025-12-31 Size : 14.12mb User : 邢姝姝
[Special Effects] zui-duan DL : 0: 最小路劲查询，源点到节点的权值与路劲走线对比选择最短路劲-Minimum Road King inquiry, the source point to the node weight compared with the Road King, choose the shortest path routing Jin
Date : 2025-12-31 Size : 18kb User : fc
[Special Effects] PSO-image-segmentation-algorithm DL : 0: 为了提高算法的执行效率, 应用粒子群算法求取图像中任意两点间最短路径来定位目标边界, 并与经典的基于Dijkstra 动态规划图搜索的Liv e Wire 算法进行比较.-In order to improve the efficiency of the algorithm, particle swarm algorithm to strike any of images to locate the shortest path between two object boundaries, and with the classical dynamic programming graph search based on Dijkstra' s algorithm to compare Liv e Wire.
Date : 2025-12-31 Size : 311kb User : 莉
[Special Effects] floyd DL : 0: 利用输入邻接矩阵来求取2点之间的最短路径-Adjacency matrix to compute using the input the shortest path between 2 points
Date : 2025-12-31 Size : 1kb User : 王宗琦
[Special Effects] output-PCNN-image-segmentation DL : 0: 由于图像的最短路径能准确地表示目标的边缘，显示强边缘特征的像素有较低的局部代价值。因此，局部代价函数由下面变化的边缘特征构造-Because the image of the shortest path to the target accurately the edge pixel edge features show strong local generation of a lower value. Thus, local changes in the cost function by the following structural characteristics of the edge
Date : 2025-12-31 Size : 721kb User : fuky
[Special Effects] floyd DL : 0: 弗洛伊德最短路径算法明白的人都知道！需要的收藏下-Freud' s shortest path algorithm to understand the people know! Collection needs, under
Date : 2025-12-31 Size : 1kb User : xiao li
[Special Effects] MATLAB-algorithm-and-program-code DL : 0: 图论算法及matlab程序代码包含求任两点间最短路径的算法及代码Floyd、kruskal，最大匹配的匈牙利算法，并使用matlab程序实现。-Graph algorithms and matlab code includes the algorithm(Floyd, kruskal, maximal matching algorithm of Hungary,) to solve the shortest path between two points, and use matlab program to realize.
Date : 2025-12-31 Size : 46kb User : 张青
[Special Effects] shortest-route DL : 0: 用的vc++6.0，做的一个最短路径查询的小程序，用的Floyd算法，自己初始化的校地图。-A shortest path query applet, using Floyd algorithm, their initialization of the school map.
Date : 2025-12-31 Size : 5mb User : 罗颖达
[Special Effects] shpath DL : 0: 规避障碍最短路径算法 Shortest Path with Obstacle Avoidance-Avoid obstacles to the shortest path algorithm Shortest Path with Obstacle Avoidance
Date : 2025-12-31 Size : 3kb User : wangliwan
[Special Effects] Dijkstra[VCPP] DL : 0: Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm for calculating a node to all other nodes in the shortest path.
Date : 2025-12-31 Size : 73kb User : 曹洪灵
[Special Effects] Dijkstra DL : 0: 单源最短路径Dijkstra。使用图论算法作为图像处理的基础算法，Dijkstra和Bellman-Ford类似，都是解决单源最短路径问题，不同的是这个方法只能解决边为非负的问题，实现的好的Dijkstra算法运行时间要快于Bellman-ford。-Single source shortest path Dijkstra. Using graph theory algorithm as the basis of image processing algorithms, Dijkstra and Bellman-Ford similar, are single-source shortest path problem to solve, except that this method can only solve the problem of non-negative side, to achieve a good running time of Dijkstra' s algorithm faster than Bellman-ford.
Date : 2025-12-31 Size : 32kb User : 小马
[Special Effects] Bellman-ford DL : 0: 单源最短路径Bellman-ford。该算法可以用来解决一般（边的权值为负）的单源最短路径问题，而dijkstra只能解决权值非负的情况。此算法使用松弛技术，对每一个顶点，逐步减少源到该顶点的路径的估计值，直到达到最短的路径。-Single source shortest path Bellman-ford. The algorithm can be used to solve the general (the right side is negative) single-source shortest path problem, and dijkstra can only solve the case of non-negative weights. This algorithm uses relaxation techniques, for each vertex, to gradually reduce the source to the vertex of the estimated value until the shortest path.
Date : 2025-12-31 Size : 33kb User : 小马
[Special Effects] Cshortest DL : 0: 用弗洛伊德算法实现的网络最短路径及平均最短路径计算-calculate the shortest path length and charicater path length of network using Floyd algorithm
Date : 2025-12-31 Size : 1kb User : lidy
[Special Effects] dijistra DL : 0: 最短路径算法的MATLAB 版的实现，实属呕心力作-The shortest path algorithm to achieve MATLAB version, it is disgusting masterpiece.
Date : 2025-12-31 Size : 18kb User : 杜
[Special Effects] road DL : 0: 提出了一种基于测地距离道路连接的方法。该方法通过对道路提取的初步结果进行去杂处理后，进而通过道路段的组织和建模，找到该条道路到邻近道路的最短路径，并结合道路的几何信息对各条最短路径进行判定，选取与原道路片段匹配程度最高的路径最为最终的连接结果。-Road to the shortest path surrounding roads, combined with road geometry information for each shortest path is determined, selecting the highest degree of matching with the original path of the road segments connecting the most final results.
Date : 2025-12-31 Size : 1.03mb User : 李
[Special Effects] co_saliency_co_segmentation DL : 0: 基于最短路径算法和视觉检测模型实现物体的联合分割-Object Co-segmentation based on Shortest Path Algorithm and Saliency Model
Date : 2025-12-31 Size : 3.63mb User : liuli
[Special Effects] The-ant-colony-algorithm DL : 0: 蚁群算法，解决了旅行商问题的最短路径，优化了路径问题-Ant colony algorithm to solve the traveling salesman problem shortest path to optimize the routing problem
Date : 2025-12-31 Size : 2kb User : 陈峰

« 12 »