doc: Edgar -> Edsger

Signed-off-by: Quentin Young <qlyoung@cumulusnetworks.com>

diff --git a/doc/user/ospf_fundamentals.rst b/doc/user/ospf_fundamentals.rst
index 7db822c8204539b25bc21fcbc5939469a8e63dc2..76a9364cf97037da0ed8ebd5bf3b57d91edb38c8 100644 (file)
--- 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