dijikstra.zip - For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
dijkstra.rar - 用Dijkstra algorithm 算法实现的路由协议，适用链路状态矢量协议ospf等， (matlab 源码）
OSPF.zip - An m file for OSPF in Wireless sensor Network simulation.
Implementation-of-OSPF-using-MATLAB - OSPF的MATLAB实现