Shortest path first
From Wikipedia, the free encyclopedia
Revision as of 06:18, 10 February 2007 by
imported>Yarq
(Shortest Path First is just a synonym for Dijkstra's algorithm. It has nothing to do with spanning tree, default route, or IP TOS.)
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Redirect page
Jump to navigation
Jump to search
Redirect to:
Dijkstra's algorithm
Navigation menu
Personal tools
Create account
Log in
Namespaces
Article
Discussion
English
Views
Read
View source
View history
More
Refresh
Search
Navigation
Main page
contents
Current events
Random article
About Wikipedia
contactpage
sitesupport
interaction
Help
introduction
Community portal
Recent changes
Upload file
Special pages
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
Cite this page
Browse properties