Shortest Path First/Definition

This article contains just a definition and optionally other subpages (such as a list of related articles), but no metadata. Create the metadata page if you want to expand this into a full article.

Shortest Path First [r]: 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