Description: 根据一个有权的无向图生成指定结点（路由器）的路由表设有结点N，N的路由表由若干个路由项组成，路由项是<目的结点，下一跳>的二元组，其中目的结点是以N结点为源结点，通过N结点可以直接到达（目的结点是N结点的邻居）或通过N结点的邻居可间接到达的结点，其中下一跳即N结点的某领居，通过该邻居可间接到达目的结点，且到达目的结点的路径为最小代价路径.-According to a right of the undirected graph to generate the specified node (router) routing table with nodes N, N' s routing table routing by a number of components, routing is < the purpose of nodes, next hop> dual group node is one of the purpose of node N as the source node by node N can arrive (the purpose of node N are neighbor nodes) or through a neighbor node N can be indirectly Get the nodes, that is one of the next hop of a node N from home, the adoption of the neighbor may be an indirect purpose of node arrival and arrival at the destination node for the smallest cost of the path path. Platform: |
Size: 1024 |
Author:luowen |
Hits:
Description: The task in this assignment is to implement an airline routing system. Your
system should be able to read in a
ight network as a graph from a le, where
airports are represented as vertices and
ights between airports are represented
as edges, take as input two airports and calculate the shortest route (ie path)
between them. Platform: |
Size: 26624 |
Author:unknown9218 |
Hits:
Description: 链路状态路由算法实现。链路状态算法又叫最短路径优先SPF（Short Path First）算法。按照SPF的要求，路由器中路由表依赖于一张能表示整个个网络拓扑结构的无向图G（V，E）。-Link state routing algorithm. Link State algorithm called the shortest path first SPF (Short Path First) algorithm. In accordance with the requirements of SPF, the router relies on a routing table can be said that the entire network topology undirected graph G (V, E). Platform: |
Size: 2048 |
Author:yiyi |
Hits:
Description: Dijkstra Algorithm - a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing. Platform: |
Size: 1024 |
Author:Andrutza |
Hits:
Description: Dijkstra s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms Platform: |
Size: 33792 |
Author:ahmed |
Hits:
Description: This is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms. NetBeans project Platform: |
Size: 26624 |
Author:Nastya |
Hits:
Description: For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).-For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
Platform: |
Size: 1024 |
Author:yashika |
Hits:
Description: Dijkstra s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959,[1][2] is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms. Platform: |
Size: 40960 |
Author:ivan |
Hits:
Description: floyd算法，用于图论中的最短路路算法，使用matlab编写，简单实用
-floyd algorithm for shortest path routing algorithm in graph theory, the use of Matlab to prepare, simple and practical Platform: |
Size: 3072 |
Author:chenxing1 |
Hits:
Description: Floyd算法的matlab实现。对输入的邻接距离矩阵计算图中任意两点间的最短距离矩阵和路由矩阵，且能查询任意两点间的最短距离和路由。并根据结果自动绘制出了最短路径图。
程序中使用了前向路由和回溯路由两种方法，并对于无向图进一步减小算法复杂度。-Matlab implementation of the Floyd algorithm. Adjacent input distance matrix between any two points in calculating the figure, the shortest distance matrix and routing matrix, and can query the shortest distance between any two points and routing. Automatically based on the results map out the shortest path graph. Used in the program prior to routing and backward routing are two methods, and undirected graph further reduce the algorithm complexity. Platform: |
Size: 479232 |
Author:lijun |
Hits:
Description: MATLAB function to partition very large graphs very fast. This function implements a graph partitioning algorithm based on spectral factorization. This algorithm is described in the following technical report:
Joã o Hespanha. An efficient MATLAB Algorithm for Graph Partitioning. Technical Report, University of California, Oct. 2004. Available at http://www.ece.ucsb.edu/~hespanha/techrep.html.
This algorithm was extensively used in this paper:
C. Lim, S. Bohacek, J. Hespanha, K. Obraczka. Hierarchical Max-Flow Routing. In Proc. of the IEEE GLOBECOM, Nov. 2005. Platform: |
Size: 122880 |
Author:leyla |
Hits:
Description: 利用MATLAB 实现Floyd 算法，可对输入的邻接距离矩阵计算图中任意两点间的最短距离矩阵和路由矩阵，且能查询任意两点间的最短距离和路由。 用MATLAB 仿真工具实现Floyd 算法：给定图G 及其边(i , j )的权
wi , j (1≤i≤n ,1≤j≤n) ，求出其各个端点之间的最小距离以及路由。
-Floyd achieved using MATLAB algorithms for the shortest distance routing adjacency matrix and distance matrix calculation map between any two points in the input matrix, and can query the shortest distance and route between any two points. Implemented in MATLAB simulation tools Floyd algorithm: G and its edge (i, j) of a given graph right wi, j (1 ≤ i ≤ n, 1 ≤ j ≤ n), find the minimum distance between the endpoints and each of its route. Platform: |
Size: 1024 |
Author:龙田隆 |
Hits:
Description: Open Source Routing Machine （OSRM）计算图像中最短的路径。coherentlyIt被设计很好运行与地图数据Openstreetmap项目。-Open Source Routing Machine computes shortest paths in a graph. It was designed to run well with map data the Openstreetmap Project. Platform: |
Size: 460800 |
Author:Chen Zhang |
Hits:
Search - routing in graph