CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - shortest path in map
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Sub Category
GUI Develop
Windows Kernel
WinSock-NDIS
Driver Develop
ADO-ODBC
GDI-Bitmap
CSharp
.net
Multimedia Develop
Communication
Shell api
ActiveX/DCOM/ATL
IME Develop
ISAPI-IE
Hook api
Screen saver
DirextX
Process-Thread
Console
File Operate
Printing program
Multi Monitor
DNA
Other
Search - shortest path in map - List
[
Windows Develop
]
danhang
DL : 0
[问题描述] 设计一个校园导游程序,为来访的客人提供各种信息查询服务。 [基本要求] (1)设计福州大学新校区的校园平面图,所含景点不少于十个。以图中 顶点表示校内各景点,存放景点名称、代号、简介等信息;以边表 示路径,存放路径长度等信息。 (2)为来访客人提供图中任意景点相关信息的查询。 (3)为来访客人提供图中任意景点的问路查询,即查询任意两个顶点之 间的一条最短的简单路径。 -[Description of the problem] to design a campus tour program for visitors, providing information services. [Basic requirements] (1) the design of the new campus of Fuzhou University campus plan, contained less than 10 spots. Vertex to map the various scenic spots in the school, the name of the storage sites, the code of the brief information to edge that path, the path length of storage of information. (2) for the visitors to provide map information on any attractions inquiries. (3) provide visitors attractions map arbitrary query to ask the way, that is, queries between any two vertices of a shortest simple path.
Date
: 2026-01-02
Size
: 1.83mb
User
:
陈燕杉
[
Windows Develop
]
MazeGame
DL : 2
程序开始运行时显示一个迷宫地图,迷宫中央有一只老鼠,迷宫的右下方有一个粮仓。游戏的任务是使用键盘上的方向键操纵老鼠在规定的时间内走到粮仓处。要求:1)老鼠形象可辨认,可用键盘操纵老鼠上下左右移动;2)迷宫的墙足够结实,老鼠不能穿墙而过;3)正确检测结果,若老鼠在规定时间内走到粮仓处,提示成功,否则提示失败;4)添加编辑迷宫功能,可修改当前迷宫,修改内容:墙变路、路变墙;5)找出走出迷宫的所有路径,以及最短路径。利用序列化功能实现迷宫地图文件的存盘和读出等功能-The beginning of the proceedings that a maze run-time map of the Central Authorities have a mouse maze, the maze of the lower right corner there is a granary. Game s mission is to use the arrow keys on the keyboard to manipulate the mouse within the required timeframe Department went granary. Requirements: 1) rats recognizable image that can be used to manipulate the keyboard or move the mouse up and down 2) strong enough wall maze, rats can not pass through walls 3) the correct test results, if the mice in the granary came within a specified time, the prompt success, failure or tips 4) to add functionality to edit the maze to modify the current maze of changes: changing the way the wall, the wall changed the way 5) to identify all the paths out of the maze, as well as the shortest path. Sequence of functions using the maze map and save the document to read out the functions of
Date
: 2026-01-02
Size
: 8kb
User
:
xiliting
[
Windows Develop
]
sheji
DL : 0
现实生活中,常常会遇到求最短路径的问题。本设计旨在提供一种解决这类问题的实例,把某一公园的景点与路线抽象成顶点和边,从而构成图,进而解决一系列相关的最短路径,最佳路线等问题。-In real life, often encountered in seeking the shortest path problem. This design is intended to provide a solution to an instance of such problems to a park attractions and routes into the abstract vertices and edges, which constitute the map, then the shortest path to solve a series of related, the best routes and other issues.
Date
: 2026-01-02
Size
: 385kb
User
:
dongdong
[
Windows Develop
]
ALGORITHME-DIJKSTRA-SUR-CARTE-FRANCE___Page
DL : 0
Application of Dijkstra s algorithm on a map of France (bottle) with 8 cities (the distance in kilometers and tps are in villes.txt). Seeks the shortest path between two points of a graph (link> 0)
Date
: 2026-01-02
Size
: 108kb
User
:
ss
[
Windows Develop
]
PAntColonySysa
DL : 0
粒子群算法的matlab程序在有障碍的路径图中寻寻找最短路径的程序。 -Particle swarm algorithm matlab program in obstacles in the road map to find to find the shortest path to the program.
Date
: 2026-01-02
Size
: 4kb
User
:
李威
[
Windows Develop
]
Graph-traversal
DL : 0
采用图的邻接矩阵或邻接表实现最短路径问题中图的存储,采用递归程序实现图的深度优先搜索(DFS)-Using adjacency matrix or adjacency list shortest path problem in memory map, using a recursive program implements graph depth-first search
Date
: 2026-01-02
Size
: 1kb
User
:
秦丽婷
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.