搜索资源列表
实现路由算法
- 实现路由算法，利用Dijkstra算法实现两台PC机之间的路由行走路径。-achieve routing algorithm, using Dijkstra algorithm between two PCs running the routing path.
rout_agrithn
- 从网上下载的路由算法C语言板，对初学者特别有用，清下载试用。-downloaded from the Internet routing algorithm C language board, especially useful for beginners, money download the trial.
lu_you_suan_fa_bull33
- 一种高效的路由表查找算法，可以方便快捷的接受，发送分组数据包-an efficient routing table lookup algorithm can be convenient and quick to accept, send a data packet
anashow
- 模拟集成电路单元电路自动布局布线算法，主要包括了线扫描算法。-Analog IC circuit modules automatic placement and routing algorithms, including the main line scanning algorithm.
Juzhsuanfa
- 这是一个矩阵算法程序 用于进行网络路邮计算,可以得到其最小路径-This a matrix algorithm for network routing, can be the smallest of its path
Matrixvectoralgorithm
- 用Dijstra算法的矩阵向量算法，用C++编写实现路由最短路径。-Dijstra algorithm using matrix vector algorithm, using C++ to prepare to achieve the shortest path routing.
DistanceectooutingAlgorith
- 距离向量路由选择算法浅析，分析优点和缺点-Distance Vector Routing Algorithm Analysis, Analysis of the strengths and weaknesses of
routerArithmetic
- 路由算法,实现两台PC机之间的路由行走路径，提供源代码-Routing algorithm to achieve between the two PC-walking path routing to provide the source code
P07164389[1].pdf
- Ant colony Algorithm for Vehicle Routing Problem wiht ComPleiton Time the pdf. it s useful to stuy GA for reader.-Ant colony Algorithm for Vehicle Routing Problem wiht ComPleiton Time the pdf. It' s useful to stuy GA for reader.
A__Pathfin1506701222002
- 最短径路的一个算法源码，delphi7可以是使用，很不错的-The shortest path routing algorithm for a source, delphi7 can be used, very good
yiqunAdhoc
- 该文件包含了蚁群算法的Adhoc多路径路由协议，对初学者很有用-This file contains the ant colony algorithm Adhoc multi-path routing protocol, useful for beginners
RoutinginZigBee
- An IEEE 802.15.4-based Wireless Sensor Network is considered, and the relationship between the IEEE 802.15.4 topology formation mechanism and possible routing strategies at the network layer is studied. Two alternative routing schemes proposed in t
routing-algorithm-paper
- Performance Evaluation of Intelligent Ant sense and AODV Routing Protocols for Personal Area Network in Different Mobilities
yyy
- 易语言连线游戏源码例程程序使用易语言画板简单实现了连线消减游戏。可改变棋盘大小和棋子颜色。 点评：易语言连线游戏源码可以作为矩阵寻路算法的例程。-Easy language online games source routines program using easy language Sketchpad simple to achieve a connection reduction game. Can change checkerboard size and pawn color.
New-folder-(2)
- 2 Introduction This educational software simulates an Ad-hoc network with AODV algorithm, it uses a high level view and only works in Routing layer. it has a user-friendly graphical user interface and has been written in java language. Here is
graphpartition
- MATLAB function to partition very large graphs very fast. This function implements a graph partitioning algorithm based on spectral factorization. This algorithm is described in the following technical report: Joã o Hespanha. An efficient MA
dsdv
- Destination-Sequenced Distance-Vector Routing (DSDV) is a table-driven routing scheme for ad hoc mobile networks based on the Bellman–Ford algorithm
Matlab-Deep-First-Search-algorithm
- MATLAB实现寻路、布线、迷宫的递归深度优先遍历算法， 程序的功能是寻找从出发点到目的地的全部可行路径， 最后只显示了最佳和最劣路径的动画效果-MATLAB realization pathfinding, routing, recursive depth-first traversal algorithm maze functionality of the program is to find all possible paths the starting point to the des
energy
- routing algorithm for destination
legend2findWay
- 传奇2自动寻路源码，计算速度快，还可继续优化。可用于传奇挂机自动寻路算法。-Legend 2 source code automatically find its way, computing speed, but also continue to optimize. Legends can be used to hang up automatic routing algorithm.