搜索资源列表
pointtopointDijkstraAlgrithms
- 具有图形化界面的一个路由模拟程序。路由算法为Dijkstra算法。具有求出图中任意节点间所有最短路径以及最短路径子图的功能。这是一个点对点(S-T)Dijkstra算法的改进。用于求两点间的所有最短路径。-graphical interface with the simulation of a routing procedures. Routing algorithm Dijkstra algorithm. With map obtained arbitrary nodes all the sh
testKrouteDll2
- 一个使用k路由算法的例子，给你的是k路由的DLL，尽管用就是了。-a routing algorithm used the example to you is the DLL k routing, despite using the grindstone.
ant1
- 利用蚂蚁算法解决TSP旅行商问题，用他能直接输出路由接点-use TSP ant algorithm to solve the traveling salesman problem, in his direct contact output routing
onebittrie
- 单比特树查找算法，是用于路由查找的，内含有路由查找相关资料-Monobit tree-search algorithm is used to identify the routing, which contain routing information Search
DRAc
- 距离向量路由算法的c源代码,希望给有兴趣的人有用-distance vector routing algorithm c source code, and hopes to give those who are interested in useful
router
- C语言路由距离向量路由算法演示程序，采用TC2.0的图形方式编程模式，主要演示路由算法
luyou.rar
- 动态路由算法，采用链路状态路由算法，显示节点信息。,Dynamic routing algorithm, using link state routing algorithm, showing node information.
luyousuanfa
- 编写一程序实现动态路由算法动态路由算法分为: 距离矢量路由算法和链路状态路由算法，-Procedures for the preparation of a dynamic routing algorithm to achieve dynamic routing algorithm as follows: distance vector routing algorithm and link state routing algorithm,
yu
- 最短路径 ----因特网最短路径优先(OSPF)路由算法的实现 ----- Internet shortest path shortest path first (OSPF) routing algorithm to achieve
OSPF
- 利用OSPF协议构造路由表，采用Dijkstra算法-Construct the routing table using OSPF protocol, using the Dijkstra algorithm
software
- 抄表，软件设计，以及方法，路由算法，路径说明-ammeter，software designed
luyousuanfa
- 有关路由算法的程序，具体要求见压缩文件内容-Routing algorithm of the procedure, specifically asked to see the contents of compressed files
Dijkstra
- Dijkstra算法是典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径。-Dijkstra' s shortest path algorithm is a typical routing algorithm used to calculate a node to all other nodes in the shortest path.
zuiduanluyou
- 计算机网络路由算法中的距离向量算法方法,这是源程序,学计算机网络的应该都知道-Computer networks in distance vector routing algorithm method, which is the source from computer network should know
router
- 路由算法，对图进行最短路径选择，只需更改最大结点个数，邻接矩阵即可使用。-Routing algorithm, the shortest path to the graph selection, simply change the maximum number of nodes, the adjacency matrix can be used.
Dijkstra-for-WSN
- 基于能量距离复合权值Dijkstra算法的新型能量均衡WSN路由算法-Weights based on the energy from the Dijkstra algorithm combined the energy balance of new routing algorithm for WSN
routing
- 模拟距离向量路由算法的路由表交换过程，演示每轮交换后路由表的变化-Simulated distance vector routing algorithm routing table exchange, presentation after each round of exchange of routing table changes
Shortest-path
- 因特网最短路径优先(OSPF)路由算法的实现：根据给定的网络拓扑图求某路由器到其它路由器的最短路径，并生成路由表-Internet Shortest Path First (OSPF) routing algorithm to achieve: given the network topology of a router to other routers find the shortest path, and generate routing tables
dj
- Dijkstra(迪杰斯特拉)算法是典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径-Dijkstra (Dijkstra) algorithm is a typical shortest path routing algorithm used to calculate a node to all other nodes of the shortest path