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

能够存储和表示给定拓扑结构 2) 能够实现Dijkstra和Bellman-ford算法 3) 根据指定结点，生成路由表并演示算法每一步执行情况 4) 加分项目：GUI界面演示所有信息 -Ability to store and represent a given topology 2) to achieve Dijkstra algorithm and Bellman-ford 3) according to a specified node, the algorithm ge

Dijkstra s algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later