搜索资源列表
-
0下载：
旅行商算法，实现从加权有向图中寻找并输出最短的闭合路径-Traveling salesman algorithm, from a weighted directed graph to find and output the shortest path closure
-
-
0下载：
在一个带权有向连通图G中，给定出发点v，求出它到所有点的最短路径长度-In a weighted directed connected graph G, given the starting point v, find it to all points of shortest path length
-
-
0下载：
Many interesting route planning problems can be solved by computing shortest paths
in a suitably modeled, weighted graph representing a transportation network. Such networks
are naturally road networks or timetable networks of public transportati
-
-
0下载：
Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。该算法名称以创始人之一、1978年图灵奖获得者、斯坦福大学计算机科学系教授罗伯特·弗洛伊德命名。-Floyd algorithm, also known as Freud algorithm, the insertion point method is an algorithm used to find the shortest path between vertices given weighted g
-
-
0下载：
主要是利用加权有向图对城市交通网进行建模，通过求解交通导航问题，熟悉图结构的储存、表示和操作，同时加深理解加权有向图的连通性判断和全源最短路径算法。-Mainly using a weighted directed graph modeling for urban traffic network by solving traffic navigation problems, get familiar store showing the structure of representation an
-
-
0下载：
从校园地图中选取有代表性景点，抽象成一个无向带权图。以图中顶点表示校内各景点，存放景点名称、代号、简介等信息。可查询景点信息和两景点的最短路径。-Choose a representative the campus map attractions, abstracted into an undirected weighted graph. Vertex to map the school attractions representation, storage attractions names
-
-
0下载：
1.从学校的平面图中选取有代表性的景点，抽象成一个无向带权图。以图中顶点表示校内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等信息。
2.为来访客人提供图中任意景点相关信息的查询。
3.为来访客人提供图中任意景点的问路查询，即查询任意两景点之间的一条最短的简单路径。-1. Choose a plan view of a representative the school s interest in the abstract as an undirected wei
-
-
0下载：
求解带权有向图中单源点的最短路径问题，在图论中有很好的应用(The shortest path problem of single source in weighted directed graph)
-
-
0下载：
运用graph；寻找最短路径（最短时间/最少换乘）(Suppose following weighted directed graph representing a local subway route network, the vertices in the graph represent the important sites in the area, the arcs represents the existing subway routs, and the weight represen
-
