Merge pull request cp-algorithms#1458 from bit-shashank/bit-shashank-patch-1

mhayter · web-flow · commit e8b714dce18b · 2025-05-02T17:54:20.000-04:00
Typo fix in graph/fixed_length_paths.md
diff --git 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:
