搜索资源列表
-
0下载：
通过对图的应用,建立一套交通网络图,实现对求单源最短路径,任意两个城市间的最短路径的查询.
首先根据邻接矩阵和图的知识建立交通网络图，顶点信息存储城市道路信息，由图的最短路径查询城市间的最短道路，输出到达路径。
-Through the diagram, the establishment of a transportation network map, to achieve for single-source shortest path between any two cities i
-
-
2下载：
//有向图:有向图,无向图基本操作
//运行环境：VC
//有向图,无向图基本操作,包括:
//1、邻接矩阵
//2、邻接表
//3、深度优先遍历
//4、广度优先遍历
//5、最小生成树
//6、拓扑排序
//7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environme
-
-
0下载：
Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges.
-
-
0下载：
In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the sh
-
-
0下载：
本课程设计的内容为“校园导航”，校园平面图中取大学的11个常去地点，其略图如图1,图中已标出主要路线，各路线的长度如表１中所示。任务定义：找出从任意场所到达另一场所的最佳路径（最短路径）。显然要解决这一问题要用“邻接矩阵”来存储各点间的距离，然后用Ｄijkstra求出最短路径。-The content of the curriculum design for the " Campus Map" plan of the campus from the University of
-
-
0下载：
以邻接矩阵的方式确定有向网，完成：
A．建立并显示出它的邻接链表；
B．以非递归方式进行深度优先遍历，显示遍历的结果，（并随时显示栈的入出情况）；
C．对该图进行拓补排序，显示拓补排序的结果，并随时显示入度域的变化情况；
D．给出某一确定顶点到所有其他顶点的最短路径-Adjacency matrix to determine a directed network, the completion of: A. To establish and demonstrate its adj
-
-
0下载：
输入图，输出最短路径。输入的图需要是 起点 距离 终点 格式-The program first read the input file to create node link list with name of nodes and count the number of nodes. Then it reread the input file to form the adjacency matrix of the graph. It has functions of creating, add
-
-
0下载：
掌握图的两种存储结构；
掌握Dijkstra算法；
掌握Prim及Kruskal算法；
邻接矩阵、最短路径及其长度
邻接表、最小生成树
-Learn two storage structure
Master Dijkstra algorithm
Master Prim and Kruskal algorithm
Adjacency matrix, and the length of the shortest path
Adjac
-
-
0下载：
数据结构实现的用邻接矩阵求出有向网内的最短路径实验报告，内含源代码-Data structures are implemented using adjacency matrix of directed network shortest path experiment report, containing the source code
-
-
0下载：
兰州道路交通网络信息查询。设计一个简单的能够实现兰州道路交通网络信息查询功能的系统。兰州道路交通网采用邻接矩阵（或邻接表）表示，包括道路交通网邻接矩阵（或邻接表）的建立、路径（或时间）的查询、最短路径（或最短时间）的查找、显示输出等功能；兰州道路交通网中顶点表示地名、图上的弧表示两地之间有路径存在、弧上的权值表示两地之间的距离（或时间）(Information query of road traffic network in Lanzhou. Design a simple system tha
-
-
0下载：
最短路径算法，/邻接矩阵法图的生成函数的最短路径算法，并生成打印图的结点标识符和邻接矩阵(The shortest path algorithm to generate the adjacency matrix of the graph function, and generate the node identifier and the adjacency matrix print map)
-
-
1下载：
运用迪杰斯特拉方案，以及邻接矩阵算出最短路径，的程序。。。。。。(The application of the Dijkstra scheme and the adjacency matrix to calculate the shortest path.)
-
-
0下载：
运用最短路径最短路径dijkstra算法设计管理咨询系统，运用邻接表和邻接矩阵相结合的存储结构(Using the shortest path shortest path Dijkstra algorithm to design the management consulting system and use the adjacency list and the adjacency matrix for the storage structure)
-
