Definition of Dijkstra Algorithm

 
 Also commonly referred as SPF (Shortest Path First). The Dijkstra algorithm is a single-source, shortest path algorithm that computes all shortest paths from a single point of reference based on a collection of link metrics. This algorithm is used to compute path preferences in both OSPF (Open Shortest Path First) and IS-IS (Intermediate System to Intermediate System). 
 
 
A - B - C - D - E - F - G - H - I - J - K - L - M - N - O - P - Q - R - S - T - U - V - W - X - Main Page