Search - search shortest path

Search - search shortest path - List

[Other] C语言实习 DL : 0: C语言实现的校园导游图,有景点的介召,最短路径的查找,还有动画等-C language map of the campus tour guides, attractions mediated response, the search for the shortest path, animation, etc.
Date : 2026-01-11 Size : 187kb User : 林巳钧
[Other] Graph DL : 0: 我编写的几个图论代码，包括深搜、最小生成树、最短路径，注释我写的很详细，大家可以作为入门参考。-I prepared a number of graph theory code, including deep search, minimum spanning tree, shortest path, notes I wrote in great detail, we can serve as a reference entry.
Date : 2026-01-11 Size : 3kb User : 彭立勋
[Other] graph1 DL : 0: 1、图的存储结构的定义和图的创建图的种类有：有向图、无向图、有向网、无向网。图的存储结构可采用：邻接矩阵、邻接表。要求：分别给出邻接矩阵和邻接表在某一种图上的创建算法 2、图的遍历：非递归的深度优先搜索算法、广度优先搜索算法。 3、图的深度遍历的应用：求无向连通图中的关节点（教材P177-178,算法7.10和7.11） 4、图的广度遍历的应用：给定图G，输出从顶点v0到其余每个顶点的最短路径，要求输出各路径中的顶点信息。 -1, map storage structure definition and graph types to create graph: directed graph, undirected graph, to the network without the network. Map storage structure can be: adjacency matrix, adjacency table. Requirements: adjacency matrix is given, respectively, and adjacent table in a certain kind of map creation algorithm 2, Graph Traversal: Non-recursive depth-first search algorithms, breadth-first search algorithm. 3, graph traversal depth of applications: for undirected connected graph of the joint points (textbooks P177-178, Algorithm 7.10 and 7.11) 4, Fig traverse the breadth of applications: a given graph G, the output from vertex v0 to The rest of each vertex of the shortest path requires the output of the vertex of the path information.
Date : 2026-01-11 Size : 6kb User : mhb
[Other] Graph2 DL : 0: 二叉树的遍历、线索化、遍历线索化二叉树等算法；深度搜索优先、广度搜索优先算法，最小生成树、最短路算法。-Binary tree traversal, threaded, threaded binary tree traversal algorithms, such as the depth of the search priority, breadth of search priority algorithm, minimum spanning tree, shortest path algorithm.
Date : 2026-01-11 Size : 307kb User : 刘飞
[Other] graph DL : 0: 图的算法的基本训练 1、图的存储结构的定义和图的创建图的种类有：有向图、无向图、有向网、无向网。图的存储结构可采用：邻接矩阵、邻接表。要求：分别给出邻接矩阵和邻接表在某一种图上的创建算法 2、图的遍历：非递归的深度优先搜索算法、广度优先搜索算法。 3、图的深度遍历的应用：求无向连通图中的关节点（教材P177-178,算法7.10和7.11） 4、图的广度遍历的应用：给定图G，输出从顶点v0到其余每个顶点的最短路径，要求输出各路径中的顶点信息。 -Map of the basic training algorithm 1 and the storage structure of the definition and plans to create the types of plans are: directed graph, undirected graph, to the network, no to the network. Map storage structure can be: adjacency matrix, the adjacent table. Requirements: adjacency matrix is given, respectively, and adjacent table in a certain kind of map creation algorithm 2, graph traversal: Non-recursive depth-first search algorithm, breadth-first search algorithm. 3, graph traversal depth of applications: for Undirected connected graph of the key points (teaching P177-178, Algorithm 7.10 and 7.11) 4, Fig traverse the breadth of applications: a given graph G, the output from the vertex v0 to The rest of each vertex of the shortest path, the path of the output requirements of the vertex information.
Date : 2026-01-11 Size : 7kb User : bueaty
[Other] Graph DL : 0: c写的贪心算法，利用指针来搜索最短路径，以及可以扩展成一般最短路径的求法-c write greedy algorithm, using a pointer to search for the shortest path, as well as the shortest path can be extended into a general law of demand
Date : 2026-01-11 Size : 189kb User : huahua
[Other] guangduyouxiansousuomigong DL : 0: 用广度优先搜索实现的搜索走迷宫最短路径，可以帮助理解广度优先搜索-Breadth-first search using the search Maze to achieve the shortest path that can help understand the breadth-first search
Date : 2026-01-11 Size : 159kb User : niebing
[Other] zuixiaolujing DL : 0: 是一种有效的寻找两点之间第一条最小路径的方法，每执行一次循环则出现最短路径的经过的节点，和它权值-Is an effective search of the method of the first minimum path between two points, executed once for each loop of the shortest path through the node, and it weights
Date : 2026-01-11 Size : 164kb User : rain
[Other] ShiWuSuDi DL : 0: 食物速递服务，哈密顿图，最短路径，满足条件，NP问题,深度优先搜索。-Food Delivery Service, Hamiltonian, shortest path, to meet the conditions, NP problems, depth-first search.
Date : 2026-01-11 Size : 1kb User : 段晓冉
[Other] laoshuzoumigong DL : 0: 实现走迷宫游戏，用广度优先搜索算法寻找最短路径-Achieve Maze game, using breadth-first search algorithm to find the shortest path
Date : 2026-01-11 Size : 27kb User : hao
[Other] Dijsktra_final DL : 0: 基于Dijkstra方法的最短路径改良版方法,能够一次性搜索出最优最优起点终点、最优路径、路径长度，常用于图论相关问题-Shortest path method ,which is based on a modified version of the method Dijkstra, is possible to search out the best starting point, terminate point, the optimal path, and the path length.It is commonly used in graph theory related issues
Date : 2026-01-11 Size : 1kb User : 钟腾
[Other] path DL : 0: 利用最短路径搜索算法,实现快速寻找路由的过称。-Use the shortest path search algorithm to find the route too fast, said.
Date : 2026-01-11 Size : 3kb User : 陈晨
[Other] software-design-I DL : 0: c++实现的非常详细的数据结构与算法代码，队列，链表，三元组，哈弗曼树，树的各种递归，非递归遍历算法，树与森林相互转化算法，图的深度，广度优先搜索算法，双连通算法，强连通算法，拓扑排序算法，最短路径算法，哈希，快速排序，归并排序等等。-C++ very detailed data structure and algorithm code, queues, linked lists, three tuple Havermann tree, various recursive tree, non recursive traversal algorithm, tree and forest mutual transformation algorithm, graph depth, breadth first search algorithm, double connectivity algorithm, strong connectivity algorithms, the topological sort algorithm, shortest path algorithm, hash, quick sort, merge sort etc..
Date : 2026-01-11 Size : 7.41mb User : 田印
[Other] Search-shortest-path DL : 0: 搜索最程路径，用于VB水准网计算，检查，联合水准网其它计算-Search the drive path for VB leveling network computing, check
Date : 2026-01-11 Size : 1kb User : ssssssssss
[Other] GraphPro DL : 0: 数据结构实验之图实验代码。实现了根据文本文件提供的信息创建图，实现图的最短路径搜索，遍历等功能。-Data structure experiment the figure of the code. Realized according to the text file to provide information to create diagrams, graph shortest path search, traversal, and other functions.
Date : 2026-01-11 Size : 1.1mb User : 陈XX
[Other] UndirectedMaximumSpanningTree DL : 0: shortest path search
Date : 2026-01-11 Size : 1kb User : Phuoc
[Other] Astar DL : 0: 启发式搜索算法之一，检查最短路径中每个可能的节点引入了全局信息，被广泛应用于路径规划领域(One of the heuristic search algorithms, which checks each possible node in the shortest path, introduces the global information, and is widely used in the field of path planning)
Date : 2026-01-11 Size : 3kb User : 姚大暖
[Other] DSLComputePath DL : 0: D star 搜索算法，从目标节点向起始点搜索，机器人沿最短路径开始移动，机器人路径规划探路的一种算法(D star search algorithm, from the target node to the starting point search, the robot moves along the shortest path, the robot path planning Pathfinder algorithm)
Date : 2026-01-11 Size : 1kb User : 姚大暖
[Other] lanzhouroad DL : 0: 兰州道路交通网络信息查询。设计一个简单的能够实现兰州道路交通网络信息查询功能的系统。兰州道路交通网采用邻接矩阵（或邻接表）表示，包括道路交通网邻接矩阵（或邻接表）的建立、路径（或时间）的查询、最短路径（或最短时间）的查找、显示输出等功能；兰州道路交通网中顶点表示地名、图上的弧表示两地之间有路径存在、弧上的权值表示两地之间的距离（或时间）(Information query of road traffic network in Lanzhou. Design a simple system that can realize the information query function of Lanzhou road traffic network. Lanzhou road traffic network using the adjacency matrix (or adjacency list) said that the road transport network including the adjacency matrix (or adjacency list) the establishment of the path (or time) of the query, the shortest path (or shortest time) search, display and output function; Lanzhou road traffic network vertices in the map, place names the said arc path exists, the arc weights that the distance between the two between the two (or time))
Date : 2026-01-11 Size : 622kb User : windy~girl
[Other] AStarPath DL : 0: A*搜寻算法俗称A星算法。A*算法是比较流行的启发式搜索算法之一，被广泛应用于路径优化领域[。它的独特之处是检查最短路径中每个可能的节点时引入了全局信息，对当前节点距终点的距离做出估计，并作为评价该节点处于最短路线上的可能性的量度。(The A* search algorithm is commonly known as the A-star algorithm. The A* algorithm is one of the more popular heuristic search algorithms and is widely used in the field of path optimization [. It is unique in that it introduces global information when examining every possible node in the shortest path, estimates the distance from the current node to the end point, and serves as a measure of the probability that the node is on the shortest route.)
Date : 2026-01-11 Size : 708kb User : xiaoqiangzi