Search - shortest path

Search - shortest path - List

[VC/MFC] Astar DL : 0: A*（A-Star)算法是一种静态路网中求解最短路最有效的方法。公式表示为： f(n)=g(n)+h(n), 其中f(n) 是节点n从初始点到目标点的估价函数， g(n) 是在状态空间中从初始节点到n节点的实际代价， h(n)是从n到目标节点最佳路径的估计代价。 -A* (A-Star) algorithm is a static network shortest path in solving the most effective way. Formula is expressed as: f (n) = g (n)+ H (n), in which f (n) is a node n from the initial point to the target point of the valuation function, g (n) in state space from the initial node to node n of the actual cost, h (n) from n to the target node of the estimated cost of the best path.
Date : 2025-12-31 Size : 13kb User : 朱宝三
[VC/MFC] 2 DL : 0: 用C语言来解决最短路径问题，主要涉及的知识主要是数据结构基本的知识，实现了能查找最短的功能．-Using C language to solve the shortest path problems, mainly related to the knowledge of the basic data structure is mainly the knowledge, the achievement of which can function to find the shortest.
Date : 2025-12-31 Size : 4kb User : lili
[VC/MFC] guandao.cpp DL : 0: 某石油公司计划建造一条由东向西的主输油管道。该管道要穿过一个有 n 口油井的油田。从每口油井都要有一条输油管道沿最短路经(或南或北)与主管道相连。如果给定 n口油井的位置,即它们的 x 坐标（东西向）和 y 坐标（南北向）,应如何确定主管道的最优位置,即使各油井到主管道之间的输油管道长度总和最小的位置?证明可在线性时间内确定主管道的最优位置,使得给定n口油井的位置,编程计算各油井到主管道之间的输油管道最小长度总和。 -An oil company plans to construct a east to west from the main pipeline. The pipeline to pass through an oil field n wells. Wells from each must have a pipeline along the shortest path (or South or North) connected with the competent Road. If given the location of oil wells in n, that is, their x coordinates (east-west) and y coordinates (north-south), should be how to determine the optimal position in charge of Road, even if the wells to the pipeline in charge of Road between the sum of the smallest length location? proved to be linear time in charge of Road to determine the optimal location, making a given n the location of oil wells, programmed to calculate the well-to-charge of Road between the length of the sum of the smallest oil pipeline.
Date : 2025-12-31 Size : 1kb User : 林雨
[VC/MFC] CSDN_Arithmetic DL : 0: CSDN论坛-算法精华.chm文件有各种各样的算法,如:最短路径有两种不同的提法：一是从某个顶点到其它顶点的最短路径，二是每一对顶点的最短路径，前者是否包含后者？若不然，前者与最小生成树有何区别？-CSDN Forum- the best algorithm. Chm file there is a wide range of algorithms, such as: the shortest path there are two different formulations: one from a vertex to other vertex of the shortest path, and second, each of the vertices of the shortest path The former contains the latter? If not, the former with the minimum spanning tree What
Date : 2025-12-31 Size : 383kb User : cloud
[VC/MFC] c_pso DL : 0: 带时间窗短最短路径的粒子群算法，非常不错的，敬请下载 -Short time window with the shortest path of the particle swarm algorithm, very good, please download
Date : 2025-12-31 Size : 742kb User : 罗佳慧
[VC/MFC] zuiduanlujing DL : 0: 这是一个实现数据结构c语言中的最短路径。最短路径是用Dijkstra算法实现的-this is a C language data structure of the shortest path.and the shortest path use Dijkstra algorithm to achieve.
Date : 2025-12-31 Size : 2kb User : 杨晓华
[VC/MFC] hitgps DL : 0: 程序的设计选用C++语言，并且界面使用MFC制作，MFC中的窗口形式使用下拉形式和扩大化设计，学校介绍、学院介绍、景点介绍采用文件方式读取，进行文件的查找，学校导航运用了图的存储结构，并显示在学校的平面图上，学校平面图采用Google Earth的卫星照片，运用平面图上各个顶点（包括主要景点及关键路口）像素位置来定位其坐标，运用弗洛伊德算法可以定位两个顶点之间的最短路径,用户还可根据需要直接在平面图上点击自己感兴趣的地点，相应的介绍会以窗口界面的形式直接显示出来。-he design selection process C++ language, and the production of MFC interface, MFC in the form of window use the drop-down form and expansion of the design of schools, colleges, the spots to introduce the use of papers read, carried out to find documents, the school used the navigation map storage structure, and show the floor plan in the school, the school plans the use of Google Earth satellite photos, floor plans on the use of all vertices (including the main attractions and key junctions) to locate the pixel position coordinates, using Floyd algorithm can be targeted between two vertices of the shortest path, the user can also directly in the plan as needed by clicking on the location of interest, the corresponding window interface will be introduced directly displayed.
Date : 2025-12-31 Size : 5.58mb User : sunwenyi
[VC/MFC] TheAlgorithmOfShortestPath DL : 0: 一款有效的最短路径算法，其中包括经典算法Dijkstra算法的VC++源代码。-An efficient shortest path algorithm, including the classical algorithm of Dijkstra algorithm for VC++ source code.
Date : 2025-12-31 Size : 909kb User : 火麒麟
[VC/MFC] VCBaseDijkstraShortestPath DL : 0: VC++实现基于Dijkstra算法的最短路径-VC++ to achieve the shortest path algorithm based on Dijkstra
Date : 2025-12-31 Size : 82kb User : 范莎
[VC/MFC] cat DL : 0: 迷宫最短路径问题，自动生成随机迷宫，并标出一条最短路径-Maze shortest path problem, automatically generate a random maze, and marked the shortest path
Date : 2025-12-31 Size : 223kb User : 薛鹏
[VC/MFC] VC DL : 0: C#毕业设计和源码实现了图形的显示、查询、漫游等，并实现了最短路径查询-C# source code to achieve the graduate Design and graphics display, query, roaming, etc., and to achieve the shortest path
Date : 2025-12-31 Size : 4.14mb User : 肾结石
[VC/MFC] path DL : 0: 我们通常所见为最短路径，最小生成树。这里是：次短路径与次小生成树问题的简单解法-We usually seen as the shortest path, minimum spanning tree. Here is: time short path spanning tree problem with sub-simple approach to
Date : 2025-12-31 Size : 4kb User : 郭东山
[VC/MFC] c4 DL : 0: 迷宫问题，寻找迷宫最短路径，用栈的存储形式进行寻找-Maze problem, find the shortest path maze, with the stack to find the storage form
Date : 2025-12-31 Size : 4kb User : xie peng
[VC/MFC] SPFA DL : 0: 最短路之SPFA算法.rar。。。算法复分析及例题设计，综合分析-The SPFA shortest path algorithm. Rar. . . Examples of complex analysis and design of algorithms, a comprehensive analysis
Date : 2025-12-31 Size : 41kb User : 卡涛
[VC/MFC] k-short-path DL : 0: K短路算法的最新求法，是每个学习程序设计的同志必备的知识！-K shortest path method for finding the latest, the design of each learning process essential knowledge, Comrade!
Date : 2025-12-31 Size : 172kb User : wenhong
[VC/MFC] Maze DL : 0: 让用户输入一个正方形的迷宫然后求出最短路径-Allow the user to enter a maze and find the shortest path
Date : 2025-12-31 Size : 380kb User : maiyuting
[VC/MFC] eight-codes-games DL : 0: 八数码问题的MFC实现，作为一个游戏而运行最终会给出最短的路径操作-Eight digital MFC implementation issues, as a game and run the final will give the shortest path operations
Date : 2025-12-31 Size : 292kb User : hcy
[VC/MFC] shortestPpath DL : 0: 最短路径的MFC实现。一个有关于最短路径算法的实例，可以通过该实例帮助大家学习MFC编程方法-MFC to achieve the shortest path. A shortest path algorithm on the instance, you can help them to learn from the examples MFC Programming
Date : 2025-12-31 Size : 8.17mb User : 王航
[VC/MFC] ba DL : 0: 此程序用来计算复杂网络的度分布集聚系数最短路径长度等-This program used to calculate the degree distribution of complex networks the shortest path length, clustering coefficient
Date : 2025-12-31 Size : 5kb User : kate
[VC/MFC] Unit-shortest-path-negative-side- DL : 0: 单元最短路径有负权边 c语言描述及其算法复杂度 -Unit shortest path negative side c language to describe their algorithm complexity
Date : 2025-12-31 Size : 1kb User : alice

« 12 3 »