搜索资源列表
luyousuanfa
- 本程序是用c语言编写的路由算法的程序，欢迎下载哈-this procedure is used to prepare the language c routing algorithm procedures, Kazakhstan welcomes Download
KSP dijkstra第k条最短路径算法
- dijkstra第k条最短路径算法 Dijkstra(迪杰斯特拉)算法是典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径。-dijkstra Kth shortest path algorithm
Dijkstra
- 网络路由Dijkstra算法程序，C-C++，可自己构建拓扑图-Dijkstra algorithm for network routing procedures, C-C++, to build their own topology
GA
- 基于免疫遗传算法的QOS路由选择问题 给予免疫遗传算法的多目标优化问题 -Immune genetic algorithm based QOS routing problems provide the immune genetic algorithm for multi objective optimization problem
FLOYD
- 基于时延的路由协议模拟器 主要使用到了计算两结点间最短路径的FLOYD算法 -Delay-based routing protocol simulator mainly used to calculate the two shortest path between nodes FLOYD algorithm
chip_pathfinder
- 在谈判阻塞算法在电路设计中的应用，该算法不断迭代直到不存在被使用一次以上的路由资源。在每一次迭代过程中，先删除每个线网，然后根据最小化成本函数的原则重新布线-Choking algorithm in the negotiations in the circuit design, the iterative algorithms have been used until there is no more than one routing resources. In each iteration,
Access-Dijkstra
- 基于access的最短路由路径Dijkstra算法的c#实现。实现路由节点间路径长短的修改，并生成最短路由表-Access based on the shortest path routing c# implementation of Dijkstra' s algorithm. Length of routing paths between nodes to achieve the changes, and generate the shortest route table
improved-pegasis
- 传统PEGASIS的算法以及基于三角模融合的链式路由的改进。-Traditional PEGASIS algorithm based on the improvements of the chain routing the Triangle Module.
Floyed-Distance-Algrothem
- 利用弗洛伊德算法实现的路由之间最短路径的计算，适合想学习算法的同学，同时可以操作文件，把初始状态的路由表记录下来作为对照-Calculation of the shortest path between the routing algorithm Freud, for students learning algorithm, can be operated at the same time file, the initial state of the routing table is recor
Shortest-path-routing-algorithm
- 最短路径路由算法——节点标记为A,B,C,D,E,结果可得到从A出发到其他节点的最短路径-Shortest path routing algorithm