clean up

Author: amejiarosario

book/book.adoc

@@ -54,7 +54,7 @@ include::chapters/chapter3.adoc[]
 
 include::chapters/chapter4.adoc[]
 
-include::chapters/action.adoc[]
+// include::chapters/action.adoc[]
 
 include::chapters/about.adoc[]
 

book/chapters/backtracking.adoc

@@ -74,7 +74,7 @@ As you can see, we iterate through each letter and swap with the following lette
 
 In the following tree, you can visualize how the backtracking algorithm is swaping the letters.
 
-[graphviz, Recursive Fibonacci call tree with dp, svg]
+[graphviz, Words Permutations, svg]
 ....
 digraph g {
   node [shape = record,height=.1];