Search - routing table

Search - routing table - List

[Data structs] network1 DL : 0: Date : Size : 2kb User : 哈哈
[Algorithm] router_calc DL : 0: 根据一个有权的无向图生成指定结点（路由器）的路由表设有结点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.
Date : Size : 1kb User : luowen
[Data structs] luyoubiao DL : 0: 路由表算法设计实现，计算机通信网课程设计可用的到-Routing table algorithm design and implementation, curriculum design of computer communication networks available to
Date : Size : 2kb User : 郁非
[Data structs] OSPF DL : 0: 利用OSPF协议构造路由表，采用Dijkstra算法-Construct the routing table using OSPF protocol, using the Dijkstra algorithm
Date : Size : 1kb User : 张会会
[Data structs] routing DL : 0: 模拟距离向量路由算法的路由表交换过程，演示每轮交换后路由表的变化-Simulated distance vector routing algorithm routing table exchange, presentation after each round of exchange of routing table changes
Date : Size : 2kb User : wulin
[Data structs] Network-node-shortest-path DL : 0: 此代码实现了网络结点之中最短路径的计算，并输出了各个网络结点的路由表，路由表包括：目的网络，下一跳，代价，详细地址。此代码的原理是Dijstra算法。在代码的注释中有测试用例,用户测试时只需将程序运行后再将测试用例复制到DOS黑框中即可。测试用例中有详细的用例解释。-This code implements the network nodes being the shortest path calculation, and output of each network node routing table, routing table, including: the destination network, the next hop, the cost, full address. The principle of this code is Dijstra algorithm. There are comments in the code test cases, users only need to run test after test cases can be copied to the DOS black borders. Test use cases in detail to explain.
Date : Size : 1kb User : 刘伟强
[Algorithm] node_generation DL : 0: this the algorithm to find the shortest path source to destination. It can be used to find and device the routing table-this the algorithm to find the shortest path source to destination. It can be used to find and device the routing table
Date : Size : 1kb User : uja