code for OSPF hope u like it-code for OSPF hope u like it

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

OPNET中ospf的djkstra算法-OPNET' s djkstra algorithm in ospf