From 46e4efa5180bfa059694dec086269806832105a7 Mon Sep 17 00:00:00 2001
From: Shashank Sahu <52148284+bit-shashank@users.noreply.github.com>
Date: Sat, 3 May 2025 00:07:17 +0530
Subject: [PATCH] Typo fix in graph/fixed_length_paths.md
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Replaced

It is obvious that the constructed adjacency matrix if the answer to the problem for the case  
$k = 1$ . It contains the number of paths of length  
$1$  between each pair of vertices.

To

It is obvious that the constructed adjacency matrix is the answer to the problem for the case  
$k = 1$ . It contains the number of paths of length  
$1$  between each pair of vertices.
---
 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 e5ecf76bc..9e1c1efad 100644
--- a/src/graph/fixed_length_paths.md
+++ b/src/graph/fixed_length_paths.md
@@ -21,7 +21,7 @@ The following algorithm works also in the case of multiple edges:
 if some pair of vertices $(i, j)$ is connected with $m$ edges, then we can record this in the adjacency matrix by setting $G[i][j] = m$.
 Also the algorithm works if the graph contains loops (a loop is an edge that connect a vertex with itself).
 
-It is obvious that the constructed adjacency matrix if the answer to the problem for the case $k = 1$.
+It is obvious that the constructed adjacency matrix is the answer to the problem for the case $k = 1$.
 It contains the number of paths of length $1$ between each pair of vertices.
 
 We will build the solution iteratively: