Shortest Path First

From Citizendium
Revision as of 10:41, 23 October 2009 by imported>Howard C. Berkowitz (New page: {{subpages}} <!-- Text is transcluded from the BASEPAGENAME/Definition subpage-->)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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 [e]

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.
Retrieved from "https://citizendium.org/wiki/index.php?title=Shortest_Path_First&oldid=700729"