Commite8b714d

authored

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

Typo fix in graph/fixed_length_paths.md

2 parents546ce11 +46e4efa commite8b714dCopy full SHA for e8b714d

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -21,7 +21,7 @@ The following algorithm works also in the case of multiple edges:`
`21`	`21`	`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$.`
`22`	`22`	`Also the algorithm works if the graph contains loops (a loop is an edge that connect a vertex with itself).`
`23`	`23`
`24`		`-It is obvious that the constructed adjacency matrixif the answer to the problem for the case $k = 1$.`
	`24`	`+It is obvious that the constructed adjacency matrixis the answer to the problem for the case $k = 1$.`
`25`	`25`	`It contains the number of paths of length $1$ between each pair of vertices.`
`26`	`26`
`27`	`27`	`We will build the solution iteratively:`

Comments

(0)