Search - shortest path in map

Search - shortest path in map - List

[Data structs] dijkstrapath DL : 0: 数据结构算法，图最短路径-data structure algorithm, the shortest path map
Date : 2026-01-02 Size : 1kb User : 李保磊
[Data structs] wuhan-traffic DL : 0: 一、目的：对应数据结构课程所学的基本原理和方法，学习图状结构求最短路径的算法，将理论知识运用于实际。二、任务：请根据附图和附表，设计一个武汉市交通导引系统。用户输入起点站和目标站，系统显示起点站到目标站的最短路径。三、要求： 1. 提示用户输入起点站和目标站 2. 系统向用户显示一条最短路径（经过站数最少的路线），如果有两条以上最短路线，则按换乘次数排序显示。 3. 显示每一条路线时，不仅要显示应搭乘的车次，还要显示应搭乘站的站名。四、提示：将每一站的权值设定为1，可以使用Dijkstra算法实现。 -one purpose : Corresponding data structure courses are taught the basic principles and methods learning map structure for the shortest path algorithm, the actual application of theoretical knowledge. Two tasks : According to the attached map and schedule, design a Wuhan city traffic guidance system. User input starting point and goal of stations, the system shows starting point to the target point is the shortest path. 3, asked : 1. prompt the user input starting point and goal of Station 2. System users to show a shortest path (at least after a few stops the line ), if there are more than two shortest routes, according to the number of transfer order shows. 3. To show a line, not only to show that the vehicles should take, but also indicate that it should be traveled Station in name. 4, T
Date : 2026-01-02 Size : 168kb User : 李明
[Data structs] Dijkstra_TA DL : 0: 数据结构的经典实验程序。以全国主要城市为图的顶点, 铁路连接为图的边, 距离作为加权, 设计完成一个最短路径自动查找系统；输入为出发城市和目标城市, 输出为最短路径和距离。 -data structure of the classic experimental procedure. In major cities across the country to the vertex, the railway linking the edge of the map, as the weighted distance, Design completed a search for the shortest path automatic system; input as the starting cities and urban target, the output for the shortest path and distance.
Date : 2026-01-02 Size : 777kb User : 王斐
[Data structs] campusNavigate DL : 1: 校园导航程序，数据结构中图的利用的典型例子（我的一次课程实验源代码），本代码用C语言编写；基本功能： 1.校园景点信息的查询功能。 2.校园景点最短路径查询功能。（求图的最小路径）-campus navigation procedures, the data structure using the map of a typical example (I once Experimental source code), The code in C language; basic functions : 1. Campus Information attractions inquiry. 2. Shortest Path campus attractions inquiry. (For the minimum path)
Date : 2026-01-02 Size : 10kb User : ARK
[Data structs] graph DL : 0: 图的最短路径查询，用与交通图中最短路径的查询-Map the shortest path query, use and transportation plans in the shortest path query
Date : 2026-01-02 Size : 2kb User : zhouyou
[Data structs] Campus-tour-guide-system DL : 0: [实验目的] 1. 熟悉图的存储结构 2. 掌握图的最短路径算法 [实验内容] 　　用无向网表示学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度等信息。要求能够回答有关景点介绍、游览路径等问题。 [实验要求] 　　1 查询各景点的相关信息；　　2 查询图中任意两个景点间的最短路径。　　3 查询图中任意两个景点间的所有路径。 -[Experimental purposes] 1. Familiar with the storage structure of Figure 2. To master plan the shortest path algorithm [experimental content] free to the net means that schools Attractions plan, map, said the main attractions vertex, store the number of spots, names, profile, etc. information, the figure that the attraction between the edges of roads, storage of information such as path length. Asked to answer questions about attractions, the tour path and so on. [Experiment] 1 query the various scenic spots in the relevant information 2 query graph between any two spots of the shortest path. 3 query graph between any two spots of all the paths.
Date : 2026-01-02 Size : 4kb User : 王建媚
[Data structs] gongyuandaoyou.c DL : 0: 给出一张某公园的导游图，游客通过终端询问可知：从某一景到另一景点的最短路径。游客从公园大门进入，选一条最佳路线，使游客可以不重复地游览各景点，最后回到出口（出口就在入口旁边）。-Zhang park gives one tour guide map, tourists asked whether we can see through the terminal: From a View to the other attractions of the shortest path. Tourists from the park gate, the election of a best route, so tourists can not visit the various scenic spots repeatedly, and finally back to exports (exports in the entrance next to).
Date : 2026-01-02 Size : 3kb User : 郑鑫
[Data structs] xiaoyuandaohangzixun DL : 0: 校园导游咨询 1．需求分析 1.1从武汉理工大学的平面图上选取10个有代表性的景点，抽象成一个带权无向图。以中顶点表示景点，边上的权值表示图两地之间的距离。 1.2本程序的目的是为用户提供景点信息及路径咨询服务。根据用户指定的景点输出景点信息，或根据用户指定的始点和终点输出相应最短路径。 1.3程序采用对话方式，先显示服务项目，由用户自己选择查询内容。-Campus tour guides Advisory 1. Demand Analysis 1.1 from Wuhan University of Technology on the plan selected 10 representative spots, abstract as a weighted undirected graph. Vertex said in spots, the edge of the weights that map the distance between the two places. 1.2 The procedures are designed to provide users with information and path attractions consulting services. According to user-specified output Attractions Attractions information, or according to user-specified starting point and the end of the output the corresponding shortest path. 1.3 procedures for the use of dialogue, to show services of their choice by the user query.
Date : 2026-01-02 Size : 102kb User : guangzhao_05
[Data structs] ZUIDUAN DL : 0: 本文提出了一种基于矢量角度的最短路径搜索算法，设计出一种类似于面向对象的数据存储结构来存储网络图中的节点及弧段对象，在最短路径的搜索上引入矢量夹角标量值做为搜索因子，充分利用了网络图中各点元素和线元素间的拓扑关系，提高了搜索的趋势性，同时还考虑了各弧段的长度值（或权值），较好的将网络图中对象的空间信息和属性信息相结合-In this paper, a vector-based perspective of the shortest path search algorithm to design a similar object-oriented data storage structure to store the network diagram of nodes and arcs object, in the shortest path search on the introduction of the vector angle between the scalar value as a search factor, make full use of the network elements in the points and lines of topological relations between elements to enhance the search trends, while also taking into account the arc length of the value (or weight), good will network map object spatial information and attribute information to combine
Date : 2026-01-02 Size : 33kb User : zh
[Data structs] tu DL : 0: 图的用法，最短路径。最小生成树等。都是C语言写的。欢迎参考-Map usage, the shortest path. Such as minimum spanning tree. Are written in C language. Welcome reference
Date : 2026-01-02 Size : 10kb User : 123123
[Data structs] shortest_path DL : 0: 分别用floyd 和dijkstra算法计算城市间最短路径的简单例子，地图由固定格式的文件输入，参考压缩包中的sample.txt,地图文件名要作为main参数-Floyd were Dijkstra algorithm and the shortest path between cities in the simple example, the map by a fixed format file input, reference compression package sample.txt, map file name to as a main parameter
Date : 2026-01-02 Size : 7kb User : 吕婉辰
[Data structs] main DL : 0: 全国交通咨询系统设计主要分三个部分：一是建立交通网络图的存储结构，二实现两个城市间的最短路经问题。3程序所具有的功能特色本程序主要目的是为了给用户提供路径咨询。实现了帮助用户了解全国各大城市间往来的最短路径问题，第二，可以提供用户查询各大城市的相关信息。本程序最大的特点是支持用户自己添加城市信息及城市，或添加城市的路径，既就有可扩展性。-National Transport Advisory System is divided into three main parts: First, establish a transportation network map of storage structure, the second between the two cities to achieve the shortest path problem. 3 procedure with the function of the main characteristics of this procedure is designed to provide users with the path to the consultation. Achieved to help users understand the major cities of the country s shortest path between the contacts and the second, user queries can provide relevant information in major cities. The greatest feature of this program is to support the user s own information and add the city of cities, or add the path of the city, both alone scalability.
Date : 2026-01-02 Size : 6kb User : zhangfengyang
[Data structs] traffic DL : 0: 利用邻接矩阵构造一张欧洲交通图，并求出某一城市到其余城市的最少票价路径或者最短里程路径，并打印输出。程序执行的命令包括：（1）初始化交通网络图并根据文件构造欧洲交通图；（2）用户先后输入“最优方式”和“始末城市名称”；（3）程序执行相关操作，打印出用户所需的信息；（4）结束。 -Adjacency matrix structure the use of a European transport plans, and obtained a city to the rest of the city or at least the shortest path fare mileage path, and print output. Procedures for the implementation of the order include: (1) to initialize the transport network map and in accordance with the European transport plan document structure (2) the user has input
Date : 2026-01-02 Size : 2kb User : sanghy
[Data structs] 1111111111 DL : 0: 设计学校的校园平面图，所含景点不少于10个，以图中顶点表示校内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等相关信息。（2）为来访客人提供图中任意景点相关信息的查询。（3）为来访客人提供景点的问路查询，即已知一个景点，查询到某景点之间的一条最短路径及长度。 -Floor plan design in schools, which contain not less than 10 spots in order to express their point of tourist attractions, scenic spots stored name, code, profile and other information that the path to side, storage-related information, such as path length. (2) for the visitors to provide map information on any attractions inquiries. (3) to provide attractions for visitors to ask the way of inquiry, that is, a scenic spot known inquiries to a certain attraction between and the length of a shortest path.
Date : 2026-01-02 Size : 3kb User : XH
[Data structs] zuiduanlujing DL : 0: 在一个赋权有向图上寻找最短路径问题也是图应用的一个重要课题-Empowering in a directed graph to find the shortest path map application is also an important topic
Date : 2026-01-02 Size : 4kb User : shangxiaobing
[Data structs] graph.yangxu DL : 0: 熟悉图的存储方式，实现图的邻接矩阵或者邻接表的存储方式下的基本运算，特别是深度遍历和广度遍历；掌握以图为基础的一些常用算法，如最小生成树、拓扑排序、最短路径等。-Familiar with the map of storage practices, and achieve adjacency matrix or adjacency list is stored under the basic operations, especially in the depth and breadth traversal traverse to attempt to grasp the basis of some commonly used algorithms, such as minimum spanning tree, topological sorting, shortest path and so on.
Date : 2026-01-02 Size : 248kb User : 胡顶豪
[Data structs] basicoperationformap DL : 0: 包括了图的大部分基本算法，每一种算法都以邻接矩阵与邻接表两种形式给出，算法包括建图，图的遍历（如DFS和BFS），最小生成树，从某个源点到蓁各顶点的最短路径等-Includes most of the basic graph algorithms, each algorithm is to adjacency matrix and adjacency list is given in two forms, algorithms, including the construction of map, graph traversal (such as DFS and BFS), the minimum spanning tree, from a source point Zhen each vertex to the shortest path, etc.
Date : 2026-01-02 Size : 239kb User : seckCoder
[Data structs] the-shortest-path-gragh DL : 0: 求一个图的最短路径的问题，程序在dos的界面下运行程序还输出了最短路径的问题-Find a map of the shortest path problem, the program interface run in the dos program also outputs the shortest path problem
Date : 2026-01-02 Size : 206kb User : 马浩原
[Data structs] Traffic-Map DL : 0: 数据结构中的交通图咨询程序，能让旅客咨询从任一城市顶点到另一城市顶点之间的最短路径（里程）或最低花费或最少时间等问题。对于不同咨询要求，可输入城市间的路程或所需时间或所需费用。-Traffic map in the data structures in the consultation process that allows the Visitor Information from the culmination of any one city to another city the shortest path between the vertices (mileage) or minimum spend or at least time. For different consultation requirements, can enter the distance between the cities or the time required or cost.
Date : 2026-01-02 Size : 2kb User : 王龙飞
[Data structs] Map DL : 0: 对图的各种操作，包括深度遍历，广度遍历，最小生成树，最短路径的各中算法，而且有递归和非递归方式，对学习数据结构有很大的帮助。代码全是自己根据理解自己写的，思路很符合初学者。-Various operations on the map, including the traverse depth, breadth traversal, minimum spanning tree, shortest path in the algorithm, and recursive and non recursive way, great help for learning data structures. Code all their own understanding of their own to write, the idea is consistent with the beginners.
Date : 2026-01-02 Size : 779kb User : wafer

« 12 »