Search - shortest path

Search - shortest path - List

[Program doc] 45322317 DL : 0: 求最短路径问题,传给大家看看,希望能对大家在实用中有点帮助-seek the shortest path problem, we look at the pass, we hope to the right a little practical help
Date : 2010-07-07 Size : 3.9kb User : 龙天翔
[Program doc] 基于MapX的道路拓扑与最短路径分析 DL : 0: 这是基于mapx对道路拓扑分析和路径最短分析的详细论文，非常有价值。-This is based on the right road MapX topological analysis and the shortest path of the detailed papers, very valuable.
Date : 2025-12-31 Size : 27kb User : 安黎
[Program doc] 11 DL : 0: 带权图的最短路径问题,主要介绍单源最短路径算法，最短路径问题的提法很多，其它的最短路径问题均可用单源最短路径算法予以解决-Weighted graph shortest path problem, mainly introduce single-source shortest path algorithm, the shortest path problem formulation of a lot of other shortest path problem can be used single-source shortest path algorithm to be addressed
Date : 2025-12-31 Size : 3kb User : sunshuquan
[Program doc] guanjianlujing DL : 0: 求一项工程完成时的最短时间和路径以及关键路径。-Completion of a project seeking the shortest time and the path and critical path.
Date : 2025-12-31 Size : 46kb User : 李鬼
[Program doc] RoutingAsOptimization DL : 0: Routing in WSN as an Optimization Problem Routing in Wireless sensor networks can be viewed as an optimization problem in which there is a need to find the optimal path (which is not necessarily the shortest one) in terms of some parameters like energy, delay and reliability.
Date : 2025-12-31 Size : 45kb User : Riham
[Program doc] multidimensional-scaling DL : 0: 本文提出一种基于多维定标的无线传感器网络三维定位算法,结合RSS经验衰减模型和最短路径建立相异性矩阵,采用轻量级矩阵分解算法降低相异性矩阵分解的计算复杂性,并利用网络中存在的周期性消息将初始定位信息回送,在后台使用迭代优化算法对初始定位结果求精。仿真实验表明,在测距误差一定的情况下,该算法能够提高节点三维坐标的初始计算精度,经过集中式的优化求精后与MDS-MAP算法相比,能够明显地提高节点三维定位的精度-This paper presents a method based on multidimensional scaling in wireless sensor network positioning algorithm, combined with RSS experience attenuation model and the shortest path to establish dissimilarity matrix, using lightweight matrix factorization algorithm reduces computational complexity dissimilarity matrix decomposition, and the use of the network in the presence of periodic messages will be the initial positioning information return, in the background using an iterative optimization the algorithm to the initial positioning results refinement. Simulation results show that, in some cases ranging error, this algorithm can improve the calculation accuracy of three-dimensional coordinates of the initial node, through the centralized optimization refinement after compared with MDS-MAP algorithm, which can obviously improve the precision of 3D Node Localization
Date : 2025-12-31 Size : 181kb User : 于文娟
[Program doc] lujing DL : 0: 用C++编写的最短路径规划程序，采用了人工势能场算法。-With C++ to write the shortest path planning process, using the artificial potential field algorithm.
Date : 2025-12-31 Size : 11kb User : 吴宇
[Program doc] floyd DL : 0: 计算两点间的最短距离，从而得到最短路径，广泛应用与数学建模。-Calculate the shortest distance between two points, the shortest path, and wider use of mathematical modeling.
Date : 2025-12-31 Size : 7kb User : 无所谓
[Program doc] folyod- DL : 0: 最短路径法，FLOYD法解决这个问题最短路径法-Shortest path method, FLOYD method to solve this problem, the shortest path method
Date : 2025-12-31 Size : 2kb User : 陈梦
[Program doc] ArcEngine--ShoutPath DL : 0: 使用ArcEngine和C#开发的最短路径代码-Use the shortest path development of ArcEngine and C# code
Date : 2025-12-31 Size : 6kb User : 王海洋
[Program doc] Shoetest-path-Genetic-Algorithms DL : 0: Shortest Path, Traveling Salesman and Hamiltonian Cycle are the other network design problem. These problems are very common to back bone network design problem. In all these three problems, the main difference is the degree of the node which is strictly two. Further, these three problems are very similar with each other. In the case of Shortest Path and Traveling salesman problem, a Hamiltonian Cycle is checked in the possible solution. Due to this similarity, these three problems are also considered in this research work. Shortest Path is considered in the terms of decision making.-Shortest Path, Traveling Salesman and Hamiltonian Cycle are the other network design problem. These problems are very common to back bone network design problem. In all these three problems, the main difference is the degree of the node which is strictly two. Further, these three problems are very similar with each other. In the case of Shortest Path and Traveling salesman problem, a Hamiltonian Cycle is checked in the possible solution. Due to this similarity, these three problems are also considered in this research work. Shortest Path is considered in the terms of decision making.
Date : 2025-12-31 Size : 328kb User : mohamed
[Program doc] dijkstraimplementation.tcl DL : 0: Dijkstra Shortest Path c++ implementation for NS2 tcl script
Date : 2025-12-31 Size : 12kb User : jimmy
[Program doc] SpathFEX05 DL : 0: Bellman-Ford-Moore Shortest Path Algorithm and its Implementation in MATLAB
Date : 2025-12-31 Size : 223kb User : qe13
[Program doc] JAVA-Router-Selection-Algorithm DL : 0: 就网络层中的路由选择算法进行了归纳和总结 ,并使用JAVA语言编写出最短通路路由选择算法的具体程序。 -On network layer routing algorithms and summarized, and the use of JAVA language shortest path routing algorithm specific procedures.
Date : 2025-12-31 Size : 76kb User : 杜晓寒
[Program doc] FuzzyPSO_2010-(1) DL : 0: A Fuzzy-Particle Swarm Optimization Based Algorithm for Solving Shortest Path Problem. Abstract—In this paper, an efficient particle swarm optimization (PSO) algorithm based on fuzzy logic for solving the single source shortest path problem (SPP) is proposed. A particle encoding/decoding scheme has been devised for particle-representation of the SPP parameters, which is free of the previously randomized path construction methods in computational problems like the SPP .The search capability of PSO is diversified by hybridizing the PSO with fuzzy logic. The local optimums will not be the point of convergence for the particles and the global optimum will be found in a shorter period of time if the PSO is correctly modified using fuzzy logic rules. Numerical computation results on several networks with random weights illustrate the efficiency of the proposed method for computation of the shortest paths in networks
Date : 2025-12-31 Size : 199kb User : mina
[Program doc] DAIMA DL : 0: 代码是图论最短路径Dijkstra的c++代码.还有常见的排序法的代码-Code is the shortest path graph Dijkstra c++ code. There are common sorting code
Date : 2025-12-31 Size : 56kb User : 赵四胖
[Program doc] kkkk DL : 0: 实现无向图的限制条件下的最短路径的代码，该算法比较精炼，适合java爱好者认真研究反复玩味-To achieve the unrestricted constraints under the conditions of the shortest path of the code, the algorithm more refined, suitable for java enthusiasts to study repeatedly
Date : 2025-12-31 Size : 5kb User : 刘恒