当前位置：
首页 资源下载
搜索资源 - shortest path weighted graph
搜索资源列表
-
0下载：
这是数学建模中图论中的几个重要的模型求解。包括最短路径的两种方法，以及加权的求法-This is the mathematical modeling of graph theory of a number of important model solution. Shortest Path, including the two methods, and the weighted Solution
-
-
0下载：
校园导游咨询：编制一个为来访客人进行最短路径导游的程序从厦门大学漳州校区的平面图中选取10个有代表性的景点，抽象成一个无向带权图。以图中顶点表示景点，边上的权值表示两地之间的距离。 2.本程序的目的是为用户提供路径咨询。根据用户指定的始点和终点输出相应路径，或者根据用户指定的景点输出景点的信息。--Campus Tour consulting: the preparation of a shortest path for visiting guests to the program guide
-
-
0下载：
Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。
-Floyd algorithm, also known as Floyd algorithm, insertion point method, is used to find a given vertex-weighted graph shortest path algorithm.
-
-
0下载：
Dijkstra算法的研究对象是赋权有向图（图用加权矩阵表示）的单源最短路径问题。可以求出任意节点到其他所有节点的最短距离。-The research object is the Dijkstra algorithm of weighted directed graph ( graph with weighted matrix) of single source shortest path problem. Can be obtained any node to all other nodes
-
-
0下载：
图论算法及其MATLAB 程序代码
1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法
2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法
3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法
6.-Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V
-
-
2下载：
Dijkstra算法，实现加权有向图中从确定的起点寻找最短路径并输出-Dijkstra algorithm, to achieve a weighted directed graph from the starting point to determine the shortest path to find and output
-
-
0下载：
旅行商算法，实现从加权有向图中寻找并输出最短的闭合路径-Traveling salesman algorithm, from a weighted directed graph to find and output the shortest path closure
-
-
0下载：
带权图的最短路径问题,主要介绍单源最短路径算法，最短路径问题的提法很多，其它的最短路径问题均可用单源最短路径算法予以解决-Weighted graph shortest path problem, mainly introduce single-source shortest path algorithm, the shortest path problem formulation of a lot of other shortest path problem can be used singl
-
-
0下载：
题目：编制一个求出网中最短路径的程序.
问题描述:计算一个有向网中位置为0 的点到其余各顶点的最短路径，以一个网状的带权有向图G6为测试内容
-Topic: establishment of a network to derive the shortest path procedure. Problem Descr iption: Calculate a network location to the point of 0 to the remaining vertex of the s
-
-
0下载：
带权有向图最短路径算法 Dijkstra算法-Weighted directed graph shortest path algorithm shortest path algorithm Dijkstra algorithm
-
-
1下载：
采用动态规划法，构建邻接矩阵带权有向图，解决最短路径问题。-Dynamic programming method used to construct adjacency matrix weighted directed graph, the shortest path to solve the problem.
-
-
0下载：
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to ano
-
-
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下载：
给定带权有向图 ，其中每条边的权都是非负实数。另外，还给定V中的一个顶点，称为源点。现在要计算从源到所有其它各顶点的最短路长度。这里路的长度是指路上各边权之和；-Given weighted directed graph, where each edge of the right of all non-negative real number. In addition, the return of a vertex set V, called the source. Now calculated
-
-
0下载：
带权有向图的最短路径及拓补排序算法,用于计算最短路径的算法-Weighted directed graph of shortest paths and expand up sorting algorithm used to calculate the shortest path algorithm
-
-
0下载：
A shortest path tree, in graph theory, is a subgraph of a given (possibly weighted) graph constructed so that the distance between a selected root node and all other nodes is minimal. It is a tree because if there are two paths between the root node
-
-
0下载：
带权有向图最短路径算法。应该可以直接运行的，很方便。-Weighted directed graph shortest path algorithm. Should be able to run directly, it is convenient.
-
-
0下载：
1.从学校的平面图中选取有代表性的景点，抽象成一个无向带权图。以图中顶点表示校内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等信息。
2.为来访客人提供图中任意景点相关信息的查询。
3.为来访客人提供图中任意景点的问路查询，即查询任意两景点之间的一条最短的简单路径。-1. Choose a plan view of a representative the school s interest in the abstract as an undirected wei
-
-
0下载：
Floyd算法又称为弗洛伊德算法、插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。(Floyd algorithm, also known as plug-in method, is an algorithm for finding the shortest path between vertices in a given weighted 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
-
