Shortest Path First/Definition

A class of routing protocol algorithms for finding optimal topologies; also called link state; basic of Open Shortest Path First; sometimes called the Dijkstra algorithm