Which algorithm does Open Shortest Path First (OSPF) use to build its shortest-path tree when determining the best routes through a network?
Ford-Fulkerson algorithm
Dijkstra's Shortest Path First (SPF) algorithm
Path Vector algorithm
Bellman-Ford algorithm
OSPF is a link-state routing protocol. Each router floods link-state information, and after building a complete topology map, it runs Dijkstra's Shortest Path First (SPF) algorithm to compute the least-cost path to every destination in its link-state database. Algorithms such as Bellman-Ford (used by distance-vector protocols like RIP), Path Vector (used by BGP), and Ford-Fulkerson (a flow-optimization algorithm not used in IP routing) are not used by OSPF.
Bash is our AI bot, trained to help you pass your exam. AI Generated Content may display inaccurate information, always double-check anything important.
All IT & Cybersecurity Package plans include the following perks and exams .
Our pricing is simple. Full access to all certifications and exams in each package, for one price.
As many practice tests for as many topics as you want.
Use study mode non-stop, no limits.
Access to our AI assistant, Bash, trained to help you pass your exam.
Track your scores over time in study mode and report cards.
See how you improve over time, and where you need to focus.
Access our store with even bigger discounts than before.
Unlimited access to all performance questions and be prepared for the real thing.
All IT & Cybersecurity Package plans include unlimited access to the following study materials.
Create an account or sign in to access our study materials.