搜索资源列表
srcspf
- 开放最短路径优先,网络协议编程,-Open Shortest Path First, the network protocol programming,
15
- OSPF是一种路由选择协议。路由选择算法和路由选择协议在概念上是不同的。网络上的主机、路由器通过路由选择算法形成路由表，以确定发送分组的传输路径。而路由选择协议是路由器用来建立路由表和更新路由信息的通信协议。 开放最短路径优先协议(Open Shortest Path First，OSPF)是目前最主要的内部网关协议之一。通过本课程设计，学生可以对路由表的建立和路由信息的更新等有更直观和清晰的认识。
Dijkstra
- C语言编程实现D算法。本实验利用Matlab实现。实现以下功能： 1输入必要参数，包括：节点个数、节点间路径长度、给定节点； 2输出给定节点到其它各节点的最短路径、径长； 3节点间路径长度用矩阵形式表示： -D C language programming algorithm. In this study, by Matlab. Achieve the following functions: 1 Enter the required parameters, includ
ArcGIS_RoutingCSharp
- 本WEBGIS程序实现了GIS中的网络分析功能（最短路径分析）-WEBGIS implementation of this procedure in the GIS network analysis function (the shortest path analysis)
OSPF
- 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
crfc2328_chinese
- 本备忘录说明了OSPF协议版本2。OSPF是一种连接状态/link-state路由协议，被设计用于单一的自制系统/Autonomous System中。每个OSPF路由器都维持着同样的数据库以描述AS的拓扑结构，并以此数据库来创建最短路径树并计算路由表。-Open Shortest Path First（OSPF）TCP/IP
n-hubshortestpathrouting
- a paper on n-hub shortest path routing implementation
SimpleRoutingTask
- arcgis server 最短路径开发-arcgis server shortest path development
linkstate
- 链路状态路由算法的实现，典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径。-Link state routing algorithm, a typical shortest path routing algorithm for calculating a node to all other nodes of the shortest path.
A-Star
- 一个非常好用的A star搜索最佳路径算法 -a best A* find the shortest path algorithm
RIP--EIGRP--and-OSPF-using-OPNET
- 本文章用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 propag
culster-table
- 通过Dijkstra算法求出路由表中的最短路径和最小跳数。-Dijkstra' s algorithm to find the shortest path and the minimum number of hops in the routing table.
the-shortest-path
- 这个是数据结构中的一个例子：在图形中寻找每一对顶点之间的最短路径。-This is the data structure of an example: in the graph to find each of the shortest path between the vertices.
betweenness
- 求出一个网络的所有最短路径，并根据最短路径求出所有节点和边的介数。适用于有向图和无向图。-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.
router
- 实现计算机网络中的路由算法，动态的更新路由器，并且能算出通信间的最短路径-In computer network routing algorithms, dynamic update router, and is able to calculate the shortest path between the communication. .
alogirthm
- this shortest path finding algorithm
spr.tar
- 最短路径路由的实现，可以作为路由学习的参考，基于NS2.-The shortest path routing to achieve, can be used as reference for learning routing based on NS2.
ShortestPath
- 利用VC++求最短路径算法，适用于网络路由算法，是一种简介有效的算法-Use VC++ Seeking the shortest path algorithm applied to network routing algorithm, is a brief and effective algorithm
RouteBarriers
- WebGIS应用实例，Flex 项目，实现最短路径分析，并可加障碍物。-WebGIS application examples, Flex projects to achieve the shortest path analysis, and add obstacles.
dijkstra--Pdial
- 比较基于最短路径的dijstra算法和dial算法的性能，主要从运算速度方面上-Performance dijstra comparison algorithm and dial-based shortest path algorithm, mainly from the operation speed