diff options
| author | Quentin Young <qlyoung@cumulusnetworks.com> | 2019-09-09 17:02:21 +0200 |
|---|---|---|
| committer | Quentin Young <qlyoung@cumulusnetworks.com> | 2019-09-09 17:02:21 +0200 |
| commit | 0e6fa0e9c7a9e3b4837e1344efd4d64c430239ea (patch) | |
| tree | 381b69a1455ad14a5781f57e52024c9b34a17e4d /doc | |
| parent | Merge pull request #4809 from martonksz/master (diff) | |
| download | frr-0e6fa0e9c7a9e3b4837e1344efd4d64c430239ea.tar.xz frr-0e6fa0e9c7a9e3b4837e1344efd4d64c430239ea.zip | |
doc: Edgar -> Edsger
Signed-off-by: Quentin Young <qlyoung@cumulusnetworks.com>
Diffstat (limited to 'doc')
| -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 7db822c82..76a9364cf 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 -`Edgar Djikstra's <http://www.cs.utexas.edu/users/EWD/>`_ +`Edsger Djikstra's <http://www.cs.utexas.edu/users/EWD/>`_ :abbr:`SPF (Shortest Path First)` algorithm. .. index:: Link-state routing protocol advantages |