From cee3e33f380435e893ac8b8c20868e4c964e80eb Mon Sep 17 00:00:00 2001
From: This-is-Adroit <167745134+This-is-Adroit@users.noreply.github.com>
Date: Sun, 8 Jun 2025 10:40:58 +0530
Subject: [PATCH] Update fixed_length_paths.md

---
 src/graph/fixed_length_paths.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/graph/fixed_length_paths.md b/src/graph/fixed_length_paths.md
index 9e1c1efad..66961bcba 100644
--- a/src/graph/fixed_length_paths.md
+++ b/src/graph/fixed_length_paths.md
@@ -63,7 +63,7 @@ Then the following formula computes each entry of $L_{k+1}$:
 $$L_{k+1}[i][j] = \min_{p = 1 \ldots n} \left(L_k[i][p] + G[p][j]\right)$$
 
 When looking closer at this formula, we can draw an analogy with the matrix multiplication:
-in fact the matrix $L_k$ is multiplied by the matrix $G$, the only difference is that instead in the multiplication operation we take the minimum instead of the sum.
+in fact the matrix $L_k$ is multiplied by the matrix $G$, the only difference is that instead in the multiplication operation we take the minimum of the sum.
 
 $$L_{k+1} = L_k \odot G,$$