Search - map file

Search - map file - List

[Data structs] kcsj DL : 0: 校园导游图算法--数据结构中有关图的算法按v求最短路径按s求信息；按q退出；地图在map图像文件里-campus tour map algorithm-- data structure of the plan according to the algorithm for the shortest path v s by seeking information; Q withdrawal by; Maps map image file
Date : 2026-01-08 Size : 47kb User : gjb
[Data structs] fan_ga111 DL : 0: 校园导游图算法--数据结构中有关图的算法按v求最短路径按s求信息；按q退出；地图在map图像文件里-campus tour map algorithm-- data structure of the plan according to the algorithm for the shortest path v s by seeking information; Q withdrawal by; Maps map image file
Date : 2026-01-08 Size : 84kb User : zh
[Data structs] 数据结构配套光盘 DL : 0: 《数据结构》配书光盘内容包括：线性表，栈和队列，串，数组与广义表，树，图，查找，排序等所以算法。该光盘中配有《数据结构》一书中的所有算法、每一个算法的 C 程序（后缀为 .cpp 的文件）及可执行文件（后缀为 .exe 的文件）。-"data structure" assigned CD include : linear table, stack and queue, strings, arrays and broad scale tree, map, search, sort, etc. So algorithm. The CD-ROM equipped with a "data structure," a book of all the algorithm, the algorithm for each one C (suffix. Cpp files) and the executable file (wayward. Exe files).
Date : 2026-01-08 Size : 2.82mb User : mars
[Data structs] park_guide DL : 0: 公园导游图给出一张某公园的导游图（景点不少于10个），游客通过终端询问可知：任一景点的相关信息；从某一景点到另一景点的最短简单路径。游客从公园大门进入，选一条最佳路线，使游客可以不重复地游览各景点，最后回到出口（出口就在入口旁边）。要求： 1、从键盘或文件输入导游图； 2、游客通过键盘选择两个景点，输出结果； 3、输出从入口到出口的最佳路线。文件中包含详细的源代码及注释,以实现这个经典的问题。-park guide map is a park guide Zhang plan (not less than 10 spots), tourists asked through a terminal known : as an attraction of relevant information; From a certain attraction to the other attractions of the shortest simple path. Tourists from the door into the park, an election the best route, so that tourists can not repeat visit to the attractions, Finally back to exports (on the export side entrance). Requirements : one from the keyboard or file input guide map; Two tourists through the keyboard to choose two spots, output; 3. output from the entrance to export the best route. Document contains a detailed source code and the Notes in order to achieve this classic problem.
Date : 2026-01-08 Size : 1kb User : agang
[Data structs] Data_ShorPath DL : 0: 数据结构课程的经典源码。以中国交通图为背景，求各大城市之间的最短路径。读文件操作。-data structure course of the classic source. China traffic map background, major cities seeking the shortest path between. Reading file manipulation.
Date : 2026-01-08 Size : 4kb User : 张龙飞
[Data structs] park DL : 0: 公园查询，类似于前几个公园导游图给出一张某公园的导游图（景点不少于10个），游客通过终端询问可知：任一景点的相关信息；从某一景点到另一景点的最短简单路径。游客从公园大门进入，选一条最佳路线，使游客可以不重复地游览各景点，最后回到出口（出口就在入口旁边）。要求： 1、从键盘或文件输入导游图； 2、游客通过键盘选择两个景点，输出结果； 3、输出从入口到出口的最佳路线。文件中包含详细的源代码及注释,以实现这个经典的问题-Park inquiry, similar to the first few park guide map gives a guided tour Zhang park plan (not less than 10 spots), we can see the tourists through the terminal asked: any relevant information spots from one spot to another spot the shortest simple 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). Requirements: 1, from the keyboard or file input guide map 2, visitors to choose the two spots through the keyboard, the output results 3, the output from the entrance to the export of the best route. File contains the source code and detailed notes in order to achieve this classic problem
Date : 2026-01-08 Size : 3kb User : 8989
[Data structs] codewac DL : 0: 数据结构：如线性表,栈和队列,数组和广义表,串,文件, 排序 , 查找, 图 ,树等的详细设计及分析方法。帮助初学者快速入门、使有一定基础的朋友有很大的提高。-Data structure: If the linear form, stack and queue, and in a broad array of tables, string, file, sort, find, map, tree, such as detailed design and analysis methods. To help beginners get started quickly, so that friends have a certain base has greatly improved.
Date : 2026-01-08 Size : 61kb User : 王阿川
[Data structs] LeastCreateTree DL : 0: 用C写的一个简单的最小生成树算法，带有图的文件结构-Using C to write a simple minimum spanning tree algorithm, with a map file structure
Date : 2026-01-08 Size : 2kb User : lanjun
[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-08 Size : 7kb User : 吕婉辰
[Data structs] wordGame DL : 0: 本文件包含两个功能相同的cpp文件，分别采用了map和priority queue两种不同的数据结构来完成显示双单词在字典动态变化的过程的功能。对于掌握数据结构有一定意义。-This file contains two cpp files with same function, but they use different data structures which are map and priority queue. The function of this file is to trace and print out the dynamic changing process in the dictionary for tow words. It s helpful for who is studying data structures.
Date : 2026-01-08 Size : 7kb User : yin zhang
[Data structs] 2009 DL : 0: 判断任意指定的图是否是树，从文件中读入图，提供实验报告-Map to determine whether any given tree, read from a file into the map, and provide experimental report
Date : 2026-01-08 Size : 1.05mb User : 涛
[Data structs] avl-tree DL : 0: 用c语言实验AVL树，程序需要外加txt文件用来创建被遍历图，相信看了程序后很简单。-AVL tree using c language experiment, procedures used to create the necessary external txt file to be traverse map, I believe after reading procedure is simple.
Date : 2026-01-08 Size : 1kb User : yujiaming
[Data structs] Cpp1 DL : 0: ）根据校园图设计带权图，图的顶点表示各地点，存放地点名称、代码、简介等信息；图的边表示路径，存放路径长度等相关信息。（校园图能手动输入或者文件导入） 2）提供任意地点相关信息的查询。 3）提供任意地点的问路查询，即查询任意两个景点之间的一条最短的简单路径。 4）提供多个地点的最佳访问路线查询，即求途经这些地点的最佳（短）路径。 -) According to the campus map design a weighted graph, the vertex that locations, storage site names, codes, profile and other information graph edges that path, the path length of storage and other related information. (Campus map can manually enter or import the file) 2) Provide information about any place queries. 3) ask for any place queries, which query between any two spots of a shortest simple path. 4) to provide the best access to multiple locations route query, that is, through these sites seeking the best (short) path.
Date : 2026-01-08 Size : 3kb User : English
[Data structs] relational DL : 1: SSD7.ER Mapping Map your ER schema into a relational database schema, using the mapping algorithm. Express the resulting relational database schema, using the following notation: PK for Primary Key, AK for Alternate Key, and FK for Foreign Key with an arrow to corresponding Table (Primary key) as given below. Show the results of your work for each step of the mapping algorithm. Submit your work in a file called relational-schema.txt.
Date : 2026-01-08 Size : 2kb User : Evgenya
[Data structs] Visit-system DL : 0: 实现功能：1,从文件读入景点信息道路信息，然后用邻接表建立校园图，用邻接矩阵存放边的信息。 2,查看景点信息，道路信息。 3,查找两点之间最短路径，采用弗洛依德算法。 4,采用深度优先递归调用的方法遍利图。-Functions: 1, read from the file into the attractions road information and the establishment of the campus map, and then use the adjacency list stored with adjacency matrix side of the information. Two view points of interest information, road information. 3, find the shortest path between two points, using the Floyd algorithm. 4, using the depth-first recursive call to all over the benefit plans.
Date : 2026-01-08 Size : 11kb User : 王琳
[Data structs] shortPathModel DL : 0: 求解交通图的最短路径，并用文件保存图的最短途径数据。求解从一个城市出发到其它所有城市的最短路径。求解从一个城市到另一个城市的最短路径。-Solving traffic map the shortest path, and use the shortest way to save the file data in Fig. Starting from one city to solve all the other cities of the shortest path. Solving from one city to another in the shortest path.
Date : 2026-01-08 Size : 322kb User :
[Data structs] Romania_Trip DL : 0: 罗马利亚度假问题一. 问题描述分别用代价一致的宽度优先、有限制的深度优先（预设搜索层次）、贪婪算法和A*算法求解“罗马利亚度假问题”。即找到从初始地点 Arad到目的地点 Bucharest 的一条路径。要求：分别用文件存储地图和启发函数表，用生成节点数比较几种算法在问题求解时的效率，并列表给出结果。-Romania holiday issue I. problem description Respectively, consistent with the cost of the breadth and the depth is limited priority (default search), greedy algorithm, A* algorithm Romania holidays . Bucharest Arad found the original location to the destination point of a path. Requirements: Using file storage map and the heuristic function table, nodes comparison algorithm efficiency in problem solving, and gave results list.
Date : 2026-01-08 Size : 352kb User : chen