Location:
Search - SHORTEST-PATHS
Search list
Description: 用无向图表示你所在学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等。
设计要求：
1．查询各景点的相关信息
2．查询图中任意两个景点间的最短路径
3．查询图中任意两个景点间的所有路径
-Undirected graph with the school' s campus attractions in your plan, said the main attractions of vertices, stored spots number, name, profile and so on. Design requirements: 1. Check information about attractions, 2. Query diagram in any shortest path between two sites 3. Query graph between any two spots all paths
Platform: |
Size: 211968 |
Author: wnn |
Hits:
Description: 迷宫问题，完成的是一个现实中的迷宫游戏求最短路径及所有路径的问题，本程序相对于航班信息查询系统比较简单，主要包含使用系统迷宫（可以选择迷宫的入口和出口，并输出所有路径和最短路径），使用新建迷宫（可以自己设计迷宫的大小，及所有通路，可以选择迷宫的入口和出口，并输出所有路径和最短路径），用到了栈的使用，如栈的创建、入栈、出栈等函数功能。 -Maze problem, complete the maze is a real game for the shortest path and all paths of the problem, the program relative to the flight information inquiry system is relatively simple and mainly consists of a maze using the system (you can select the entry and exit the maze, and the output of all path and the shortest path), use the new labyrinth (maze can design the size, and all the channels, you can choose the maze entrance and exit, and output all the paths and the shortest path), use the stack to use, such as the creation of the stack, stack , the stack so the function function.
Platform: |
Size: 9216 |
Author: lijin |
Hits:
Description: 输入节点个数和路径权重可得到任意两点之间的最短路径，放在Muti_Cost矩阵中-Input node number and weight of available paths the shortest path between any two points, on Muti_Cost matrix
Platform: |
Size: 3072 |
Author: masai |
Hits:
Description: Furthermore, the simulator actually build in another algorithm - Dijikstra Algorithm. This algoritm is the best and fastest algo in solving shortest path problem. It s actually used to compare wtih GA in solving a specified situation. Simulator also build in with all potential path generation mechanism, but it depend on maps and the source and destnation location that user choose. Sometimes, it will take long time to get all the posible paths generated. However, this mechanism is actually implemented in a thread
Platform: |
Size: 137216 |
Author: celine |
Hits:
Description: 旅行商问题(TSP问题)就是一销售商从n个城市中的某一城市出发，不重复地走完其余n-1个城市并回到原出发点，在所有可能的路径中求出路径长度最短的一条。
本题假定该旅行商从第1个城市出发。-Traveling salesman problem (TSP problem) is a vendor from the n cities, starting in a city, do not finish the rest of repeated n-1 cities and return to the original starting point, calculate all possible paths in the shortest path length one. This question assumes that the traveling salesman starting from a city.
Platform: |
Size: 1024 |
Author: Cindy |
Hits:
Description: 校园导航，实现最短路径。每两个场所间可以有不同的路，且路长也可能不同，找出从任意场所到达另一场所的最佳路径（最短路径）。-Campus navigation, to achieve the shortest path. Between every two places can have different paths, and path length may be different, to find another place to reach from any place the best path (shortest path).
Platform: |
Size: 1024 |
Author: zhangqingshui |
Hits:
Description: 老鼠走迷宫程序实际示例 可以寻找所有路径以及找出所有路径当中的最短路径。-Mouse Maze procedure can find all the practical example of the path and find the shortest path among all paths.
Platform: |
Size: 2048 |
Author: 石玉 |
Hits:
Description: 问题描述：用无向图表示你所在学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等。
设计要求：
1．查询各景点的相关信息；
2．查询图中任意两个景点间的最短路径；
3．查询图中任意两个景点间的所有路径。
-Problem Description: The undirected graph that spot in your school campus plan, said the main attractions of vertices, the number of storage sites, name, profile and so on. Design requirements: 1. Query information about tourist attractions 2. Query graph in any shortest path between two sites 3. Query graph between any two spots of all paths.
Platform: |
Size: 269312 |
Author: zilin |
Hits:
Description: 作者Andrew V. Godberg
本文介绍一种解决网络最大流问题的算法。-Abstract. All previously known efftcient maximum-flow algorithms work by finding augmenting paths,
either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortest-length
augmenting paths at once (using the layered network approach of Dinic).
Platform: |
Size: 1408000 |
Author: waterrenny |
Hits:
Description: 校园导航
该程序运行为实现设计我们的学校的平面图，包括10个以上的场所，每两个场所间可以有不同的路，且路长也可能不同，找出从任意场所到达另一场所的最佳路径（最短路径）。-Campus navigation for the realization of the program is designed to run our school' s plan, including more than 10 sites, each between the two places can have different paths, and path length may be different, to find another place to reach from any place of the most best path (shortest path).
Platform: |
Size: 162816 |
Author: lixuefeng |
Hits:
Description: 预设城市之间距离，显示任意两个城市之间最短距离以及所经过的路径！-The default distance between cities, indicating the shortest distance between any two cities, and the paths!
Platform: |
Size: 2048 |
Author: 武江伟 |
Hits:
Description: 校园导航程序，支持任意数的顶点和边数，直接输入即可，可以查询两点间的所有路径，最短距离，Dijstra和Floyd算法都有-Campus navigation, support for any number of vertices and edges, can be directly input, you can query all paths between two points, the shortest distance, Dijstra and Floyd algorithm has
Platform: |
Size: 4096 |
Author: xian |
Hits:
Description: 设计连云港市导游系统。以图中顶点表示各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等相关信息。
为来访客人提供图中任意景点相关信息的查询。
为来访客人提供图中任意景点的问路查询，即查询任意两个景点之间的一条最短的简单路径。
提供图中任意景点查询，即求任意两点间的所有路径。
导游图的景点和道路的修改扩充功能。
-Lianyungang City guide system design. To vertices that the attractions, storage sites name, code, profile and other information the side that path, the path length of storage and other related information. The figure for visiting any sites offering information related to queries. Offers a map for visiting attractions, ask any query, that query between any two spots of a shortest simple path. Any spots available in the query graph, ie find all paths between any two points. Road map guide attractions and changes to extensions.
Platform: |
Size: 4096 |
Author: 刘 |
Hits:
Description: 设在图G={V,E}中有一顶点r，Dijkstra算法可以求出其他所有点到点r的最短路径的跳数，这是求单源最短路径的一个最基本的算法。-There is a vertex, r, in the graph G={V,E}. As to every other vertex v, there exist several paths between v and r. The Dijkstra algorithm can get the hop count of the shortest path among those between v and r.
Platform: |
Size: 1024 |
Author: wx |
Hits:
Description: 走迷宫
程序开始运行时显示一个迷宫地图，迷宫中央有一只老鼠，迷宫的右下方有一个粮仓。游戏的任务是使用键盘上的方向键操纵老鼠在规定的时间内走到粮仓处。
要求：
1老鼠形象可辨认，可用键盘操纵老鼠上下左右移动；
2迷宫的墙足够结实，老鼠不能穿墙而过；
3正确检测结果，若老鼠在规定时间内走到粮仓处，提示成功，否则提示失败；
4找出走出迷宫的所有路径，以及最短路径。
另希望能说明采用的设计方法、设计技术路线，包括采用的设计方法和步骤以及任务流程图，指定的功能模块说明、设计说明，越详细越好。-Maze
Displayed when the program starts running a maze map, there is a rat maze center, bottom right of the maze there is a granary. Game is to use the arrow keys on the keyboard to manipulate the mouse come within the stipulated time at the barn.
Requirements:
A recognizable image of the mouse, the keyboard can be used to manipulate the mouse down and move around
Wall strong enough 2 maze, rats can not pass through walls
3 correct test results, if the rats come within the specified time at the barn, suggesting that success or failure of prompt
4 out of the maze to find all the paths, and the shortest path.
Also hope to illustrate the design approach, design lines, including use of design methods and procedures, and task flow diagram, description of specific modules, design specifications, the more detailed the better.
朗读显示对应的拉丁字符的拼音
字典
Platform: |
Size: 1024 |
Author: 孙婷婷 |
Hits:
Description: 基于access的最短路由路径Dijkstra算法的c#实现。实现路由节点间路径长短的修改，并生成最短路由表-Access based on the shortest path routing c# implementation of Dijkstra' s algorithm. Length of routing paths between nodes to achieve the changes, and generate the shortest route table
Platform: |
Size: 91136 |
Author: lizheng |
Hits:
Description: 校园导游系统：设计一个校园导游程序，为来访的客人提供各种信息的查询服务。设计自己学校的校园平面图，所含景点不少于10个。以图中顶点表示校内各景点，存放景点名称、代码 、简介等信息；以边表示路径，存放路径长度等相关信息。具体功能包括：
1.为来访客人提供图中任意景点相关信息的查询；
2.为来访客人提供图中任意景点的问路查询，求任意景点间的所有路径，以及查询任意两个景点之间的一条最短的简单路径。
3.为来访客人提供校园图中多个景点的最佳访问路线查询，即求途径多个景点的最短路经。
4.校园导游图的景点和道路的扩充修改功能。
5.实现校园导游图的仿真界面
-Campus Tour Guide System: Design a campus tour guide program for visiting guests a variety of information inquiry services. Design their own school campus plan, contained less than 10 spots. To graph vertices represent various school sites, storage sites names, codes, profile and other information the side that path, the path length of storage and other related information. Specific features include:
1 figure for visiting any sites offering information related to the query
(2) offers the figure for visiting attractions, ask any queries, find all paths between any sites and attractions between any two inquiries a shortest simple path.
3 offers campus map for visiting many attractions in the best access routes queries, that is seeking the shortest path approach many attractions.
4 Campus Tour road map of attractions and expansion of modification.
5 to achieve campus tour map of the simulation interface
Platform: |
Size: 36864 |
Author: |
Hits:
Description: 校园导游程序
（1） 查询各景点的相关信息；
（2） 查询图中任意两个景点间的最短路径。
（3） 查询图中任意两个景点间的所有路径。
（4） 增加、删除、更新有关景点和道路的信息
-Campus Tour Program (1) check the attractions of the relevant information (2) the query graph in any shortest path between two sites. (3) the query graph between any two spots of all paths. (4) add, delete, update, information on attractions and road
Platform: |
Size: 4096 |
Author: 林源远 |
Hits:
Description: 有n个城市，一个推销员要从其中的某一个城市出发，每个城市只能遍历一次，要求走遍所有的城市，再回到他出发的城市，求所有可能路径中路径最短的一条路径来-N cities, a salesman from which a city departure, each city can only traverse requirements went through all of the city, and then returned to the city of his departure, seeking all possible paths the shortest path a pathcome
Platform: |
Size: 5120 |
Author: 吴非凡 |
Hits:
Description: 寻求最短路径的matlab程序
pathS: 所求最短路径的起点
pathE :所求最短路径的终点 -Matlab program pathS seek the shortest path: the shortest path starting point pathE: The end of the shortest path
Platform: |
Size: 1024 |
Author: sun |
Hits: