Location:
Search - route-back
Search list
Description: 公园导游图
给出一张某公园的导游图（景点不少于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.
Platform: |
Size: 1614 |
Author: agang |
Hits:
Description: 本程序利用数据结构中的回溯算法的非递归对以知地图进行全路线查找，可以完成最短路线，最少费用，和所有路线的显示-procedures for the use of the data structure of the back - recursive algorithm right to know what the road map for the entire search, the shortest route to be completed, at least cost, and all the routes show
Platform: |
Size: 878857 |
Author: 刘晶 |
Hits:
Description: 公园导游图
数据结构课程设计作业
需要的人下
功能：给出一张某公园的导游图，游客通过终端询问可知：
从某一景点到另一景点的最短路径。游客从公园大门进入，选一条最佳路线，使游客可以不重复地游览各景点，最后回到出口（出口就在入口旁边）。-park guide map data structure curriculum design requires a person under functions : Zhang is a park guide map, asked tourists through the terminal known : from one attraction to another attraction of the shortest path. Park visitors from entering the gate, an election the best route, so that tourists can not repeat visit to the attractions, Finally back to exports (exports next to the entrance).
Platform: |
Size: 3227 |
Author: 吉庆 |
Hits:
Description: % MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) % Finds a (near) optimal solution to a variation of the M-TSP by setting % up a GA to search for the shortest route (least distance needed for % each salesman to travel from the start location to individual cities % and back to the original starting place)
Platform: |
Size: 4058 |
Author: 5501018333@qq.com |
Hits:
Description: 公园导游图
给出一张某公园的导游图（景点不少于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.
Platform: |
Size: 1024 |
Author: agang |
Hits:
Description: 本程序利用数据结构中的回溯算法的非递归对以知地图进行全路线查找，可以完成最短路线，最少费用，和所有路线的显示-procedures for the use of the data structure of the back- recursive algorithm right to know what the road map for the entire search, the shortest route to be completed, at least cost, and all the routes show
Platform: |
Size: 878592 |
Author: 刘晶 |
Hits:
Description: 公园导游图
数据结构课程设计作业
需要的人下
功能：给出一张某公园的导游图，游客通过终端询问可知：
从某一景点到另一景点的最短路径。游客从公园大门进入，选一条最佳路线，使游客可以不重复地游览各景点，最后回到出口（出口就在入口旁边）。-park guide map data structure curriculum design requires a person under functions : Zhang is a park guide map, asked tourists through the terminal known : from one attraction to another attraction of the shortest path. Park visitors from entering the gate, an election the best route, so that tourists can not repeat visit to the attractions, Finally back to exports (exports next to the entrance).
Platform: |
Size: 3072 |
Author: 吉庆 |
Hits:
Description: 介绍CISCO路由器的备份与平时的维护注意点...给大家看看吧-Introduction CISCO router backup and maintenance of the normal attention to point us look at it ...
Platform: |
Size: 88064 |
Author: 李密 |
Hits:
Description: 公园查询，类似于前几个公园导游图 给出一张某公园的导游图（景点不少于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
Platform: |
Size: 3072 |
Author: 8989 |
Hits:
Description: 给出一张某公园的导游图，游客通过终端询问可知：从某一景到另一景点的最短路径。游客从公园大门进入，选一条最佳路线，使游客可以不重复地游览各景点，最后回到出口（出口就在入口旁边）。-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).
Platform: |
Size: 3072 |
Author: 郑鑫 |
Hits:
Description: 旅行商问题的实现，用来寻找一个最短的路线通过所有的点并回到原点。-The realization of traveling salesman problem, to find the shortest route through all the points and back to square one.
Platform: |
Size: 864256 |
Author: Eric Roy |
Hits:
Description: 这个插件的优点之一是可以支持不同的GPS软件所生成的航迹、航点、线路，我们常用的oziexplorer也在支持之列。外出时我们可以用GPS手持机记录航迹，回来后用Ozi将机器中保存的航迹、航点导出，生成plt或wpt文件。然后再启动WorldWind，接着调用GPS2WorldWind插件，将Ozi的航迹、航点文件导入，再选择Show in WW就可以将航迹显示在WorldWind中。-One of the advantages of the plug-ins can support different software generated GPS track, route points, lines, we often use is also supporting the list of oziexplorer. When they go out we can use GPS handset track record, came back with Ozi the machine kept track, export destinations, to generate plt or wpt file. And then restart WorldWind, then call the plug-GPS2WorldWind will Ozi track, destinations file and choose Show in WW can be displayed on the track in WorldWind.
Platform: |
Size: 359424 |
Author: adrian |
Hits:
Description: PowerPCB教程简介
欢迎使用 PowerPCB 教程。本教程描述了PADS-PowerPCB 的绝大部分功能
和特点，以及使用的各个过程，这些功能包括：
· 基本操作
· 建立元件(Component)
· 建立板子边框线(Board outline)
· 输入网表(Netlist)
· 设置设计规则(Design Rule)
·元件(Part)的布局(Placement)
· 手工和交互的布线
· SPECCTRA全自动布线器(Route Engine)
·覆铜(Copper Pour)
· 建立分隔/混合平面层(Split/mixed Plane)
· Microsoft 的目标连接与嵌入(OLE)(Object Linking Embedding)
· 可选择的装配选件(Assembly options)
· 设计规则检查(Design Rule Check)
· 反向标注(Back Annotation)
· 绘图输出(Plot Output)
使用本教程后，你可以学到印制电路板设计和制造的许多基本知识。
你不必一次完成整个教程，如果在任何时候退出后，下次直接找到你要进入
的部分，继续学习本教程。
当你完成了本教程的学习后，可以参考在线帮助(On-line Help)以便得到更多
的信息。如果你需要附加的信息内容，你可以与PADS 在各地办事处或代理商取
得联系，以便得到更多的帮助。
欢迎使用PowerPCB进行PCB设计！-PowerPCB Tutorial Tutorial Introduction Welcome to PowerPCB. This tutorial describes the PADS-PowerPCB the vast majority of functions and features, and the use of the various processes, including: the establishment of the basic operation component (Component) to establish a border line board (Board outline) enter Table (Netlist) set design rules (Design Rule) component (Part) layout (Placement) manual and interactive cloth
Platform: |
Size: 2532352 |
Author: 陈斌 |
Hits:
Description: 课程设计：
用无向网表示学校的校园景点平面图，图中顶点表示主要景点，
存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度等信息。要求能够回答有关景点介绍、游览路径等问题。游客通过终端可询问：
（1）从某一景点到另一景点的最短路径。
（2）游客从公园进入，选取一条最佳路线。
（3）使游客可以不重复地浏览各景点，最后回到出口（出口就在入口旁边）。
-Curriculum design:
Net free to express School campus sites floor plans, maps vertex express the main attractions,
Store the number of spots, names, information such as brief introduction, the figure that the edge of the road between attractions, such as information storage path length. Requirements be able to answer questions about attractions, the tour path and so on. Tourists through the terminal can be asked:
(1) from one spot to another spot the shortest path.
(2) visitors from the park to enter, select the best route.
(3) so that visitors can browse the various scenic spots in duplicate, and finally back to exports (exports at the entrance on the side).
Platform: |
Size: 232448 |
Author: 赵刚 |
Hits:
Description: 用堆栈实现迷宫求解问题
基本思想:
若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小:M*N.迷宫设置自定义。
求解迷宫问题的简单方法是：从入口出发，沿某一方向进行探索，若能走通，则继续向前走；否则沿原路返回，换一方向再进行探索，直到所有可能的通路都探索到为止。
为避免走回到已经进入的点（包括已在当前路径上的点和曾经在当前路径上的点），凡是进入过的点都应做上记号。-Maze with the stack to achieve the basic idea for solving the problem: If the current position can be adopted, in pressure, otherwise the next location to explore, if a dead end, then back to New Moon, the size of the maze: M* N. maze set up a custom. A simple maze to solve the problem is: starting from the entrance, along a certain direction to explore, can walk, then continue to move forward otherwise return along the same route, a direction for further exploration, until all possible pathways are exploring to date. In order to avoid going back to have access points (including the current path and current path in the point), all the points should be entered mark.
Platform: |
Size: 34816 |
Author: Tantan |
Hits:
Description: Program helping you to remember the route.
It cab be route from conference room to coffee-room, it can be tourist trip, it can be pathway in labyrinth. during first traversal you make notes in you phone, specifying direction of movement and target of each step. Phone remembers how much time each steps takes. Then you can just inspect information about this trip and check duration of each stage and the whole trip. You can also replay it in forward and backward direction. So if somebody show you the shortest way to coffee machine, you can easily find the way back and can repeat this trip in future. - * The main menu of TripMate contains list of trips. Add new trip and specify its description. The program automatically switches to the mode of specifying the trip. In this mode you are adding trip points. For each point you should specify direction and optional description (target). When all steps are specified, choose Finish command to end the trip. It is possible to edit description and direction of each point, but it is not possible to add or remove new points to the trip. If you close application in enter trip mode, it will be in the same mode after restart. TripMate automatically calculate time of each stage (point time is set when you execute Enter command)
* When trip is finished, you can view and edit trip points (List command) and relay trip in forward or backward direction (Navigation command). Navigation is performed using the same time scale. You can suspend/resume navigation or visa versa move current position to the next point. Navigation is perform in graphic o
Platform: |
Size: 67584 |
Author: tang |
Hits:
Description: 1、设计要求
（1）自动寻迹小车从安全区域启动。
（2）小车按指定路线运行，自动区分直线轨道和弯路轨道，在指定弯路处拐弯，实现灵活前进、转弯、倒退等功能，在轨道上划出设定的地图。
-1, the design requirements (1) Auto-tracing car security zone from the start. (2) designated route by car to run automatically distinguish between the track and made a detour straight track, turning in the designated detour Department to achieve a flexible forward, turn, back and other functions, in the orbit of the map drawing settings.
Platform: |
Size: 140288 |
Author: 闫石 |
Hits:
Description: 求解方法是：从入口出发，顺某个方向走，若能过去，继续；否则，沿着原路返回，换方向继续走，直到所有可能的通路都被找到为止。-Solving method is: starting from the entrance, and to conform to a direction, if in the past, continue otherwise, along the same route back, changing direction to go, until all the possible paths have been found so far.
Platform: |
Size: 1024 |
Author: 张臻 |
Hits:
Description: 使用者在车载GPS导航系统上任意标注两点后，导航系统便会自动根据当前的位置，为车主设计最佳路线。另外，它还有修改功能，假如用户因为不小心错过路口，没有走车载GPS导航系统推荐的最佳线路，车辆位置偏离最佳线路轨迹200米以上，车载GPS导航系统会根据车辆所处的新位置，重新为用户设计一条回到主航线路线，或是为用户设计一条从性位置到终点的最佳线路。-After the user on any car GPS navigation system marked by two points, the navigation system will automatically according to the current location for owners to design the best route. In addition, it also modify the function, because the best route if the user does not accidentally miss the intersection, did not take the car GPS navigation system recommended by the vehicle deviates from the optimum position of the track 200 meters above the line, in-car GPS navigation system which is based on a new vehicle position, re-designed for users of a route back to the main routes, or for the user to design an optimal route from the neutral position to the end.
Platform: |
Size: 2123776 |
Author: 霍新伟 |
Hits:
Description: (1) 问题描述:
设计一个国际象棋的马踏棋盘的演示程序.
(2) 基本要求:
将马随机放在国际象棋的8*8棋盘的某个方格中,马按走棋规则进行移动.要求每个方格只进入一次,走遍棋盘上全部64个方格.编制非递归程序,求出马的行走路线,并按求出的路线,将1,2,…,64依次填入一个8*8的方阵,输出之.
(3) 程序的输入和输出及程序的功能:
使用者输入一个位置如:3,4.注意中间默认要以”,”隔开.并且数字的大小要在[0,7].程序会根据使用者的要求进行一次以8*8矩阵形式输出结果或演示寻找行走路线的回溯过程.
-(1) description of the problem:
Design a chess board horse riding board demo program.
(2) basic requirements:
The horses were placed in the chess board 8* 8 a box, Ma playing chess rules according to mobile. Requires that each box to enter only one, traveled on board all 64 squares. The preparation of non recursive program, seeking to lobby the walking route, and according to the calculated route will be 1,2,... , 64 in order to fill in a 8*8 matrix, the output.
(3) the input and output of the program and the function of the program:
The user to enter a position such as 3,4. pay attention to the middle of the default to , separated. And the size of the digital to program in [0,7]. according to user s requirement of a 8* 8 matrix to output the results or demo for walking route back in the process.
Platform: |
Size: 113664 |
Author: 梁文水 |
Hits: