diff options
| author | Ruben Kerkhof <ruben@rubenkerkhof.com> | 2019-09-11 20:35:06 +0200 |
|---|---|---|
| committer | Ruben Kerkhof <ruben@rubenkerkhof.com> | 2019-09-11 20:35:06 +0200 |
| commit | afb2a168bba90fbe5b3778fa8c79f536ce38dbe8 (patch) | |
| tree | df997d0905549fc513c67d95ad24dc0b19d2534e /doc/user | |
| parent | Merge pull request #4722 from ak503/static (diff) | |
| download | frr-afb2a168bba90fbe5b3778fa8c79f536ce38dbe8.tar.xz frr-afb2a168bba90fbe5b3778fa8c79f536ce38dbe8.zip | |
doc: Djikstra -> Dijkstra
Signed-off-by: Ruben Kerkhof <ruben@rubenkerkhof.com>
Diffstat (limited to 'doc/user')
| -rw-r--r-- | doc/user/ospf_fundamentals.rst | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/user/ospf_fundamentals.rst b/doc/user/ospf_fundamentals.rst index 76a9364cf..da348b02d 100644 --- a/doc/user/ospf_fundamentals.rst +++ b/doc/user/ospf_fundamentals.rst @@ -24,7 +24,7 @@ Each router thus builds up an :abbr:`LSDB (Link State Database)` of all the link-state messages. From this collection of LSAs in the LSDB, each router can then calculate the shortest path to any other router, based on some common metric, by using an algorithm such as -`Edsger Djikstra's <http://www.cs.utexas.edu/users/EWD/>`_ +`Edsger Dijkstra's <http://www.cs.utexas.edu/users/EWD/>`_ :abbr:`SPF (Shortest Path First)` algorithm. .. index:: Link-state routing protocol advantages |