From a938a237c5f8d8b2d0f7f7db0861f84b6a2fc725 Mon Sep 17 00:00:00 2001 From: jafar75 Date: Wed, 20 Mar 2024 20:39:53 +0330 Subject: [PATCH] fix: typo in bellmanford description (#711) --- graph/bellmanford.go | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/graph/bellmanford.go b/graph/bellmanford.go index c9e791f6d..f130a4e06 100644 --- a/graph/bellmanford.go +++ b/graph/bellmanford.go @@ -1,5 +1,5 @@ // The Bellman–Ford algorithm is an algorithm that computes shortest paths from a -// single source vertex to all of the other vertices in a weighted durected graph. +// single source vertex to all of the other vertices in a weighted directed graph. // It is slower than Dijkstra but capable of handling negative edge weights. // https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm // Implementation is based on the book 'Introduction to Algorithms' (CLRS)