搜索资源列表
get_shortest_paths
- 通过定义邻接矩阵,计算节点之间的最短路径长度-By defining the adjacency matrix to calculate the shortest path between node length
ds_3
- 有向无环图的拓扑排序 用邻接矩阵保存图,边的输入采用三元组(求最短路径)和二元组(拓扑排序)。-DAG topological sort of the adjacency matrix with the preservation plan, while the use of triple input (for the shortest path) and the dual group (topological sort).
zuiduanlujing
- 以邻接矩阵为存储结构,实现弗洛伊德算法求解每一对顶点之间的最短路径及最短路径长度。-Adjacency matrix for storage in the structure of each algorithm for the realization of Freud on the shortest path between the vertex and the length of the shortest path.
daolujiaotongchaxun
- 道路交通查询:兰州道路交通网采用邻接矩阵(或邻接表)表示,包括道路交通网邻接矩阵(或邻接表)的建立、路径(或时间)的查询、最短路径(或最短时间)的查找、显示输出等功能;兰州道路交通网中顶点表示地名、图上的弧表示两地之间有路径存在、弧上的权值表示两地之间的距离(或时间); -Road Traffic Inquiry: Maryland road transport network using adjacency matrix (or adjacency list) that the road
xiaoyuandaohangxitong
- 本课程设计的内容为“校园导航”,校园平面图中取大学的11个常去地点,其略图如图1,图中已标出主要路线,各路线的长度如表1中所示。任务定义:找出从任意场所到达另一场所的最佳路径(最短路径)。显然要解决这一问题要用“邻接矩阵”来存储各点间的距离,然后用Dijkstra求出最短路径。-The content of the curriculum design for the " Campus Map" plan of the campus from the University of
ComputerTest
- 采用邻接矩阵实现有向网的存储,建立有向网,并实现单源最短路径算法。-Adjacency matrix are used to achieve the network storage, establishing the network, and to achieve single-source shortest path algorithm.
directed_network
- 以邻接矩阵的方式确定有向网,完成: A.建立并显示出它的邻接链表; B.以非递归方式进行深度优先遍历,显示遍历的结果,(并随时显示栈的入出情况); C.对该图进行拓补排序,显示拓补排序的结果,并随时显示入度域的变化情况; D.给出某一确定顶点到所有其他顶点的最短路径-Adjacency matrix to determine a directed network, the completion of: A. To establish and demonstrate its adj
johnson
- 多源最短路径的johnson算法,采用邻接矩阵作为图的表示,使用最小二叉堆实现最小优先队列。-johnson algorithm for shortest path
FindTheShortestWayInaMap
- 读取存有邻接矩阵的txt文件,并将该计算从起始点至某点的最短路径-It is a program to find a shortest way between two different places.
aaa
- 对任意给定的图(顶点数不小于20,边数不少于30,图的类型可以是有向图、无向图、有向网、无向网),能够输入图的顶点和边(或弧)的信息,并存储到相应存储结构(邻接矩阵、邻接表、十字链表、邻接多重表,任选其中两种类型),对自己所创建的图完成以下操作: 对无向图求每个顶点的度,或对有向图求每个顶点的入度和出度(5分) 完成插入顶点和边(或弧)的功能(5分) 完成删除顶点和边(或弧)的功能(5分) 两种存储结构的转换(5分),如果其中一种存储结构为十字链表或邻接多重表则增加5分。
SHORTEST
- 弗洛伊德求最短路径的VC算法 #include <iostream> using namespace std #define MAXV 50 #define INF 32767 typedef int InfoType //邻接矩阵存储方法 typedef struct { -Freud find the shortest path algorithm# include VC <iostream> using namespace s
ShortPath_DIJ
- 数据结构中的缔结斯特拉最短路径源程序,在DEV c++中测试通过,数据结构为邻接矩阵-Data structures concluded Stella source shortest path, in DEV c++ in the test, the data structure of adjacency matrix
zuiduanlujin
- 利用邻接矩阵构造图,并求出某一顶点到其余顶点的最短路径并打印输出。-Using the adjacency matrix structure maps, and find the rest of the vertices of a vertex to the shortest path and print output.
hh
- 基于邻接矩阵求最短路径 最简单的 。-java shortpath
router
- 路由算法,对图进行最短路径选择,只需更改最大结点个数,邻接矩阵即可使用。-Routing algorithm, the shortest path to the graph selection, simply change the maximum number of nodes, the adjacency matrix can be used.
floyd
- 利用输入邻接矩阵来求取2点之间的最短路径-Adjacency matrix to compute using the input the shortest path between 2 points
dijkstra_cSharp
- 求有向图的邻接矩阵中,两点之间的最短路径以及长度-Digraph adjacency matrix, the shortest path between two points and the length of the
12452
- 在vc控制台中运行,用遗传算法求解最短路径,用邻接矩阵表示路线图。-Vc console in the run, the shortest path with the genetic algorithm, said the road map with the adjacency matrix.
dijkstra
- Dijkstra最短路算法Matlab程序,用于求从起始点s到其它各点的最短路 D为赋权邻接矩阵需要输入 d为s到其它各点最短路径的长度 pre记载了最短路径生成树-Dijkstra shortest path algorithm Matlab procedures for the request from the starting point s to the other points for the empowerment of the most short-circuit th
FLOYD
- 弗洛伊德算法 求两点最短路径 (c++)图用邻接矩阵表示-Freud seeking two shortest path (c++)