Search - shortest path C

Search - shortest path C - 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-17 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-17 Size : 4kb User : lili
[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-17 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-17 Size : 5.58mb User : sunwenyi
[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-17 Size : 4.14mb User : 肾结石
[VC/MFC] tu DL : 0: 数据结构域算法之图包括最短路径最佳路径以及图的建立等的C语言编码-Data domain algorithm Figure C language code, including the shortest path to the best path and Figure establishment
Date : 2025-12-17 Size : 1.65mb User : Paggy
[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-17 Size : 1kb User : alice
[VC/MFC] shortpath DL : 0: ArcEngine 最短路径分析(C#源码)-ArcEngine shortest path analysis (C# source code)
Date : 2025-12-17 Size : 10kb User : huxuguang
[VC/MFC] CPP DL : 0: 1，最短路径问题：给你n个点，m条无向边，每条边都有长度d和花费p，给你起点s终点t，要求输出起点到终点的最短距离及其花费，如果最短距离有多条路线，则输出花费最少的。输入：输入n,m，点的编号是1~n,然后是m行，每行4个数 a,b,d,p，表示a和b之间有一条边，且其长度为d，花费为p。最后一行是两个数 s,t 起点s，终点t。n和m为0时输入结束。 (1<n<=1000, 0<m<100000, s != t) 输出：输出一行有两个数，最短距离及其花费。 2，建立一个图 3，建一个图书馆管理系统，说明：程序使用说明：本程序是简单的图书管理系统，分为添加新书、浏览全部图书和删除图书三个功能。输入1可添加新书，分别输入书名、ISDN、价格和作者后，即添加完成。输入2可浏览全部的图书。输入3可删除图书，输入要删除的行号，即可删除该行，如果输入的行号是最后一行，即删除全部。 4，最小生成树prim算法 5，C++primer 教材电子版（第四版）-1, the shortest path problem: Give you n points, m strip undirected edges, each side has a length d and spending p, to give you a starting point s end t, the required output starting the shortest distance to the end of its cost, if the shortest distance between multiple routes, the output of the least expensive. Input: Input n, m, the point number is 1 ~ n, then the m rows, each row 4 numbers a, b, d, p, between a and b represents an edge and having a length of d, cost for p . The last line is the two numbers s, t starting point s, end t. n and m are 0:00 input ends. (1 <n <= 1000, 0 <m <100000, s! = T) Output: There are two output a line number, the shortest distance and cost. 2, the establishment of a graph 3, built a library management system, Definitions: Instructions for use: This program is a simple library management system, divided into adding new books, browse books and books delete all three functions. Enter 1 to add new books, and receive
Date : 2025-12-17 Size : 2.33mb User : 刘小喵
[VC/MFC] c DL : 0: A*算法实现静态规避，找到一条从起点到终点的最短路径并打印出此路径。-* algorithm avoid static, find a shortest path the starting point to the end point and print out this path.
Date : 2025-12-17 Size : 3kb User : 张倩倩
[VC/MFC] C++数据结构课程设计-校园导游咨询系统 DL : 0: 校园导游系统，输出最短路径以及最佳路径，建立良好的人机界面，供用户使用(Campus tour guide system, output the shortest path and the best path, establish a good man-machine interface for users to use)
Date : 2025-12-17 Size : 917kb User : 111黎黎