From afb2a168bba90fbe5b3778fa8c79f536ce38dbe8 Mon Sep 17 00:00:00 2001 From: Ruben Kerkhof Date: Wed, 11 Sep 2019 20:35:06 +0200 Subject: [PATCH] doc: Djikstra -> Dijkstra Signed-off-by: Ruben Kerkhof --- doc/user/ospf_fundamentals.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/doc/user/ospf_fundamentals.rst b/doc/user/ospf_fundamentals.rst index 76a9364cf9..da348b02d2 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 `_ +`Edsger Dijkstra's `_ :abbr:`SPF (Shortest Path First)` algorithm. .. index:: Link-state routing protocol advantages -- 2.39.5