Search - shortest path

Search - shortest path - List

[Internet-Network] 15 DL : 0: OSPF是一种路由选择协议。路由选择算法和路由选择协议在概念上是不同的。网络上的主机、路由器通过路由选择算法形成路由表，以确定发送分组的传输路径。而路由选择协议是路由器用来建立路由表和更新路由信息的通信协议。开放最短路径优先协议(Open Shortest Path First，OSPF)是目前最主要的内部网关协议之一。通过本课程设计，学生可以对路由表的建立和路由信息的更新等有更直观和清晰的认识。
Date : 2008-10-13 Size : 1.06kb User : 猪八戒
[Internet-Network] DistanceVector_Routing DL : 0: Distance Vector Routing，也称为Bellman-Ford shortest path algorithm。基本思想是：每个路由器（路由结点）都维持一张路由表，包括路由的目的地(V)和路由的距离(D)。每个路由器都定期与相邻结点交换路由表信息，据此更新它们自己的路由表。所有结点都监听从其它结点传来的路由表，并按照下列规则更新其路由表： -发现了一条到达某目的结点的新路由，而该路由在原来的路由表中不存在（即发现了一条新路由），则在路由表中增加该路由。 -发现了一条到达某目的结点的、距离更短的新路由，则用该路由替换原有的路由。 -到达某目的结点的一条路由，其后继结点到达该目的地的距离发生了变化，则需要更新该路由的距离。本文件中包含详细的源代码和注释，以实现利用距离向量算法更新路由表的功能。-Distance Vector Routing, also known as the Bellman-Ford shortest path algorithm. The basic idea is : Each router (routing nodes) has maintained a routing table, the destinations include routing (V) and the routing of distance (D). Each router regularly with neighboring nodes to exchange routing table information, updated accordingly their own routing table. All nodes are monitored from other nodes sent a routing table, and in accordance with the following rules to update its routing table :- found a purpose to reach a node of the new routing, The routing of the original routing table does not exist (that is, found a new routing), the routing table to increase the routing.- Found a purpose to reach an end point, the short distance between the new routing, the router can be used to replace
Date : 2025-12-31 Size : 3kb User : agang
[Internet-Network] ShortestPath_Djk DL : 0: 单源最短路径问题的一种求解算法－Dijkstra算法-Single-source shortest path algorithm A-Dijkstra algorithm
Date : 2025-12-31 Size : 1kb User : 王振兴
[Internet-Network] router DL : 0: 基于vc6.0的路由最短路径算法设计！可以根据节点路径长度计算最短路径！-Vc6.0 based on the shortest path routing algorithm design! Node path length can be calculated in accordance with the shortest path!
Date : 2025-12-31 Size : 241kb User : xuzhinan
[Internet-Network] 15 DL : 0: OSPF是一种路由选择协议。路由选择算法和路由选择协议在概念上是不同的。网络上的主机、路由器通过路由选择算法形成路由表，以确定发送分组的传输路径。而路由选择协议是路由器用来建立路由表和更新路由信息的通信协议。开放最短路径优先协议(Open Shortest Path First，OSPF)是目前最主要的内部网关协议之一。通过本课程设计，学生可以对路由表的建立和路由信息的更新等有更直观和清晰的认识。 -OSPF is a routing protocol. Routing algorithm and routing protocol in the concept is different. Network hosts, routers, routing algorithm, through the formation of routing table to determine the sending packet transmission path. The routing protocol is a router used to create routing tables and update the routing information of the communication protocol. Open Shortest Path First protocol (Open Shortest Path First, OSPF) is the most important one of the internal gateway protocol. Through the curriculum design, students can establish a routing table and routing information updates such as more intuitive and clear understanding.
Date : 2025-12-31 Size : 1kb User : 猪八戒
[Internet-Network] ArcGIS_RoutingCSharp DL : 0: 本WEBGIS程序实现了GIS中的网络分析功能（最短路径分析）-WEBGIS implementation of this procedure in the GIS network analysis function (the shortest path analysis)
Date : 2025-12-31 Size : 55kb User : yorkliu
[Internet-Network] OSPF DL : 0: OSPF- Open shortest path first. which a routing protocol. uses IP version 4-OSPF- Open shortest path first. which a routing protocol. uses IP version 4
Date : 2025-12-31 Size : 8kb User : Muni
[Internet-Network] crfc2328_chinese DL : 0: 本备忘录说明了OSPF协议版本2。OSPF是一种连接状态/link-state路由协议，被设计用于单一的自制系统/Autonomous System中。每个OSPF路由器都维持着同样的数据库以描述AS的拓扑结构，并以此数据库来创建最短路径树并计算路由表。-Open Shortest Path First（OSPF）TCP/IP
Date : 2025-12-31 Size : 120kb User : maying
[Internet-Network] SimpleRoutingTask DL : 0: arcgis server 最短路径开发-arcgis server shortest path development
Date : 2025-12-31 Size : 129kb User : 张岳峰
[Internet-Network] linkstate DL : 0: 链路状态路由算法的实现，典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径。-Link state routing algorithm, a typical shortest path routing algorithm for calculating a node to all other nodes of the shortest path.
Date : 2025-12-31 Size : 2kb User : shangyong
[Internet-Network] A-Star DL : 0: 一个非常好用的A star搜索最佳路径算法 -a best A* find the shortest path algorithm
Date : 2025-12-31 Size : 65kb User : Stanley
[Internet-Network] RIP--EIGRP--and-OSPF-using-OPNET DL : 0: 本文章用OPNET作为工具，建设不同的模拟场景和参数，分析RIP，EIGRP和OSPF这三种路由协议的优缺点。-Performance Analysis of RIP, EIGRP, and OSPF using OPNET.Routing protocols are key elements of modern communication networks. Currently deployed dynamic routing protocols that are used to propagate network topology information to the neighboring routers are Routing Information Protocol (RIP), Enhanced Interior Gateway Routing Protocol (EIGRP), and the Open Shortest Path First (OSPF) protocol. The choice of the right routing protocol depends on a number of parameters. In this paper, we use OPNET Modeler to analyze the performance of RIP, EIGRP, and the OSPF protocols, which are commonly deployed in Internet Protocol (IP) networks. We designed various simulation scenarios to compare their performance.
Date : 2025-12-31 Size : 319kb User : fafan
[Internet-Network] the-shortest-path DL : 0: 这个是数据结构中的一个例子：在图形中寻找每一对顶点之间的最短路径。-This is the data structure of an example: in the graph to find each of the shortest path between the vertices.
Date : 2025-12-31 Size : 3kb User : 徐紫瑞
[Internet-Network] culster-table DL : 0: 通过Dijkstra算法求出路由表中的最短路径和最小跳数。-Dijkstra' s algorithm to find the shortest path and the minimum number of hops in the routing table.
Date : 2025-12-31 Size : 7kb User : luochen
[Internet-Network] betweenness DL : 0: 求出一个网络的所有最短路径，并根据最短路径求出所有节点和边的介数。适用于有向图和无向图。-All the shortest path in a network is obtained, the dielectric number of all the nodes and edges and was determined according to the shortest path. Applicable to a directed graph and no directed graph.
Date : 2025-12-31 Size : 1kb User : 樊冰
[Internet-Network] router DL : 0: 实现计算机网络中的路由算法，动态的更新路由器，并且能算出通信间的最短路径-In computer network routing algorithms, dynamic update router, and is able to calculate the shortest path between the communication. .
Date : 2025-12-31 Size : 24kb User : 王荣
[Internet-Network] alogirthm DL : 0: this shortest path finding algorithm
Date : 2025-12-31 Size : 1kb User : arvind
[Internet-Network] spr.tar DL : 0: 最短路径路由的实现，可以作为路由学习的参考，基于NS2.-The shortest path routing to achieve, can be used as reference for learning routing based on NS2.
Date : 2025-12-31 Size : 33kb User : 江先亮
[Internet-Network] ShortestPath DL : 0: 利用VC++求最短路径算法，适用于网络路由算法，是一种简介有效的算法-Use VC++ Seeking the shortest path algorithm applied to network routing algorithm, is a brief and effective algorithm
Date : 2025-12-31 Size : 6kb User : niora
[Internet-Network] RouteBarriers DL : 0: WebGIS应用实例，Flex 项目，实现最短路径分析，并可加障碍物。-WebGIS application examples, Flex projects to achieve the shortest path analysis, and add obstacles.
Date : 2025-12-31 Size : 3.86mb User : liuqizhi

« 12 »