Description: 这是数学建模中图论中的几个重要的模型求解。包括最短路径的两种方法，以及加权的求法-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 Platform: |
Size: 3905 |
Author:王清 |
Hits:
Description: 这是数学建模中图论中的几个重要的模型求解。包括最短路径的两种方法，以及加权的求法-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 Platform: |
Size: 4096 |
Author:王清 |
Hits:
Description: 给出一个带权有向图，该程序可以打印出从原点到其他所有点的最短路径。内容包含测试数据及问题的详细描述。-Give a weighted directed graph, the program can print out from the origin to all other points of the shortest path. Contains test data and detailed description of the problem. Platform: |
Size: 166912 |
Author:张蕾 |
Hits:
Description: 给定一个带权有向图 G=(V,E) ，其中每条边的权是一个非负实数。
另外，还给定 V 中的一个项点，称为源。
现在我们要计算从源到所有其他各项点的最短路径长度。
这里的长度是指路上各边权之和。
这个问题通常称为单源最短路径问题。-Given a weighted directed graph G = (V, E), in which each edge of the right is a non-negative real number. In addition, V also set a key point, as the source. Now we have to calculate from the source to all other points of the shortest path length. Here refers to the length of each side of the road and right. This problem is often referred to as single-source shortest path problem. Platform: |
Size: 2048 |
Author:yp |
Hits:
Description: 本次试验是讨论单源点的最短路径问题:给带权有向图和源点V到G中其余各顶点的最短路径。-The test is to discuss single-source shortest path problem: given weighted directed graph and source point V to the G in the remaining vertex of the shortest path. Platform: |
Size: 1024 |
Author:Rachel |
Hits:
Description: 单源最短路径问题：给定带权有向图G=(V,E)。给定V中的一个顶点v，称为源。要计算从源到所有其它各顶点的最短路径长度。-Single-source shortest path problem: a given weighted directed graph G = (V, E). Given a vertex V in v, known as the source. To calculate from the source to all other vertices of the shortest path length. Platform: |
Size: 1024 |
Author:忠波 |
Hits:
Description: 校园导游咨询
1．需求分析
1.1从武汉理工大学的平面图上选取10个有代表性的景点，抽象成一个带权无向图。以中顶点表示景点，边上的权值表示图两地之间的距离。
1.2本程序的目的是为用户提供景点信息及路径咨询服务。根据用户指定的景点输出景点信息，或根据用户指定的始点和终点输出相应最短路径。
1.3程序采用对话方式，先显示服务项目，由用户自己选择查询内容。-Campus tour guides Advisory 1. Demand Analysis 1.1 from Wuhan University of Technology on the plan selected 10 representative spots, abstract as a weighted undirected graph. Vertex said in spots, the edge of the weights that map the distance between the two places. 1.2 The procedures are designed to provide users with information and path attractions consulting services. According to user-specified output Attractions Attractions information, or according to user-specified starting point and the end of the output the corresponding shortest path. 1.3 procedures for the use of dialogue, to show services of their choice by the user query. Platform: |
Size: 104448 |
Author:guangzhao_05 |
Hits:
Description: Dijkstra算法，实现加权有向图中从确定的起点寻找最短路径并输出-Dijkstra algorithm, to achieve a weighted directed graph from the starting point to determine the shortest path to find and output Platform: |
Size: 180224 |
Author:曹雷 |
Hits:
Description: 旅行商算法，实现从加权有向图中寻找并输出最短的闭合路径-Traveling salesman algorithm, from a weighted directed graph to find and output the shortest path closure Platform: |
Size: 179200 |
Author:曹雷 |
Hits:
Description: 带权图的最短路径问题,主要介绍单源最短路径算法，最短路径问题的提法很多，其它的最短路径问题均可用单源最短路径算法予以解决-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 single-source shortest path algorithm to be addressed Platform: |
Size: 3072 |
Author:sunshuquan |
Hits:
Description: 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 another on a road map in this case, the vertices represent locations and the edges represent segments of road and are weighted by the time needed to travel that segment. This app. is demo for this.-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 another on a road map in this case, the vertices represent locations and the edges represent segments of road and are weighted by the time needed to travel that segment. This app. is demo for this. Platform: |
Size: 70656 |
Author:kassi |
Hits:
Description: 图论算法及其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, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6. Platform: |
Size: 47104 |
Author:肖翔 |
Hits:
Description: 带权有向图的最短路径及拓补排序算法,用于计算最短路径的算法-Weighted directed graph of shortest paths and expand up sorting algorithm used to calculate the shortest path algorithm Platform: |
Size: 5120 |
Author:steven |
Hits:
Description: 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 and some vertex v (i.e. a cycle), we can delete the last edge of the longer path without increasing the distance from the root node to any node in the subgraph.
If every pair of nodes in the graph has a unique shortest path between them, then the shortest path tree is unique. This is because if a particular path from the root to some vertex is minimal, then any part of that path (from node u to node v) is a minimal path between these two nodes.
In graphs with no negative distances, Dijkstra s algorithm computes the shortest path tree, from a given vertex. In graphs with possibly negative distances, the Bellman-Ford algorithm can be used instead. Platform: |
Size: 7168 |
Author:darulor |
Hits:
Description: 带权有向图最短路径算法。应该可以直接运行的，很方便。-Weighted directed graph shortest path algorithm. Should be able to run directly, it is convenient. Platform: |
Size: 1024 |
Author:JASON____WANG |
Hits:
Description: 1.从学校的平面图中选取有代表性的景点，抽象成一个无向带权图。以图中顶点表示校内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等信息。
2.为来访客人提供图中任意景点相关信息的查询。
3.为来访客人提供图中任意景点的问路查询，即查询任意两景点之间的一条最短的简单路径。-1. Choose a plan view of a representative the school s interest in the abstract as an undirected weighted graph. Vertex to map the school attractions representation, storage attractions names, code names, profiles and other information Edge said the path to the storage path length and other information.
2. provide visitors attractions FIG query any relevant information.
3. Provide any figure attractions for visiting guests ask queries that query an attraction between any two shortest simple path. Platform: |
Size: 4096 |
Author:min zou |
Hits:
Description: Floyd算法又称为弗洛伊德算法、插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。(Floyd algorithm, also known as plug-in method, is an algorithm for finding the shortest path between vertices in a given weighted graph.) Platform: |
Size: 2048 |
Author:铭MARS花
|
Hits:
Description: 运用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 represent the time duration from one site to another one. Try to design a subway route query system to help the users find
(a) the way to go from one site to another one in shortest time(weighted shortest path)
(b) the way to go from one site to another one with minimal transfer(unweighted shortest path), for the routes with same transfer times choose the one costing shortest time.) Platform: |
Size: 106496 |
Author:durian27 |
Hits:
Search - shortest path weighted graph