May 2, 2025 · May 2, 2025
diff --git a/src/graph/fixed_length_paths.md b/src/graph/fixed_length_paths.md
 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 matrixif the answer to the problem for the case $k = 1$.
 It is obvious that the constructed adjacency matrixis 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:
Original file line number	Diff line number	Diff line change
Expand Up		@@ -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 matrixif the answer to the problem for the case $k = 1$.
		It is obvious that the constructed adjacency matrixis 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:
Expand Down