bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fix grammar

This commit is contained in:
Antti H S Laaksonen 2017-04-19 21:08:54 +03:00
parent 0527dbd60d
commit a456fedeff
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
chapter16.tex
View File

@ -532,7 +532,7 @@ defines the following graph:
Since each node in a successor graph has a Since each node in a successor graph has a
unique successor, we can define a function $f(x,k)$ unique successor, we can define a function $f(x,k)$
that returns the node that we will reach if that gives the node that we will reach if
we begin at node $x$ and walk $k$ steps forward. we begin at node $x$ and walk $k$ steps forward.
For example, in the above graph $f(4,6)=2$, For example, in the above graph $f(4,6)=2$,
because we will reach node 2 by walking 6 steps from node 4: because we will reach node 2 by walking 6 steps from node 4: