用Dijkstra algorithm 算法实现的路由协议，适用链路状态矢量协议ospf等， (matlab 源码）-This program uses the Dijkstra algorithm to find the lowest cost paths from every node to every other node.

用Bellman-Ford 算法实现的路由协议，适用距离矢量协议bgp 等， （matlab 源码）-This program uses the Bellman-Ford algorithm to find the set of routing tables which would be generated in the BGP protocol

用matlab写的AODV路由发现的程序，还存在一些不足，不能在跳数大于3时不能将路由连接起来；在统计路径跳数时不准确，代码效率肯定不高。希望还能跟大家交流一下，1020575254@qq.com-the program was written by matlab，there were some disadvantages existed such as cannot connect the route S→D，the hop may not accurate