Levenshtein+Distance技术资料下载专区，收录48份相关技术文档、开发源码、电路图纸等优质工程师资源，全部免费下载。
Implementations of a queue in C with algoritmo BFS, that calculates the minimum distance in a graph.
按需路由协议- AODV AODV（Ad Hoc on demand distance vector) C++源代码
·Shape Representation and Registration using Vector Distance Functions [cvpr07]
This function is used to evaluate the max height and the max distance of a projectile and plot the trajectory. I...
The algorith divides rows in to four equal groups. The rows are then used to from a distance graph which is then transfo...
zigbee路由算法采用AODV(Ad hoc On Demand Distance Vetor)算法。每个路由器维护一张路由表，并定期与其邻居路由器交换路由信息，根据最小路由矢量更新自己的路由表。应用层框架定义监护网络节点协议。
个程序实现了距离矢量路由算法,又称Bellman-Ford算法,使用java编程实现.-This process achieved a distance vector routing algorithm, also known as Bel...
个程序实现了距离矢量路由算法,又称Bellman-Ford算法,使用java编程实现.-This process achieved a distance vector routing algorithm, also known as Bel...