graph search docs

Author: amejiarosario

book/book.adoc

@@ -84,7 +84,6 @@ include::chapters/tree--search.adoc[]
 
 include::chapters/tree--self-balancing-rotations.adoc[]
 
-
 :leveloffset: +1
 
 include::chapters/tree--avl.adoc[]

book/chapters/algorithms-analysis.adoc

@@ -24,18 +24,16 @@ Before going deeper, into space and time complexity, let's cover the basics real
 Algorithms (as you might know) are steps of how to do some task. When you cook, you follow a recipe (or an algorithm) to prepare a dish. Let's say you want to make a pizza.
 
 .Example of an algorithm
-//[source, js]
+// [source, js] // undefined functions
 ----
-function bakePizza(dough, toppins = []) {
+function bakePizza(dough, toppins = ['cheese']) {
     const heatedOven = heatOvenTo(550);
     punchDown(dough);
     rollOut(dough);
     applyToppings(dough, toppings);
     const pizza = heatedOven.bakePizza(dough)
     return pizza;
 }
-
-bakePizza(new Dough, ['ham', 'cheese']);
 ----
 
 If you play a game, you are devising strategies (or algorithms) to help you win. Likewise, algorithms in computers are a set of instructions used to solve a problem.

book/chapters/cheatsheet.adoc

@@ -88,7 +88,7 @@ This section covers Binary Search Tree (BST) time complexity (Big O).
 {empty}* = Amortized run time. E.g. rehashing might affect run time to *O(n)*.
 
 
-Time complexity for a Graph data structure
+.Time complexity for a Graph data structure
 |===
 .2+.^s| Data Structure 2+^s| Vertices 2+^s| Edges .2+^.^s| Space Complexity
 ^|_Add_ ^|_Remove_ ^|_Add_ ^|_Remove_
@@ -99,6 +99,7 @@ Time complexity for a Graph data structure
 
 == Sorting Algorithms
 
+.Sorting algorithms comparison
 |===
 | Algorithms     | Runtime    | Space       | Stable | In-place | Online | Adaptive | Comments
 | Insertion sort | O(n^2^)    | O(1)        | Yes    | Yes      | Yes    | Yes      |

book/chapters/graph-search.adoc

@@ -1,11 +1,14 @@
 = Graph Search
 
-Quis officia proident fugiat elit cupidatat voluptate. Aliqua anim nulla nulla nisi anim cupidatat eu culpa velit cupidatat. Id duis do esse aliquip fugiat non ea. Fugiat dolore aliquip eu commodo. Sint ex et ullamco laboris consequat non sint id.
+Graph search allows you to visit all the elements connected given a starting node. There are two ways to navigate the graph, one is using Depth-First Search (DFS) and the other one is Breadth-First Search (BFS). Let's see the difference.
 
-== Depth First Search
+== Depth-First Search
 
-Commodo culpa qui officia eiusmod irure culpa elit excepteur culpa. Tempor aute nisi excepteur qui. Sit in irure aliqua Lorem tempor ut minim. Magna amet nisi sint labore tempor in commodo consequat dolor cupidatat cillum non pariatur reprehenderit. Ex esse cupidatat sunt dolore non commodo est aute.
+As we saw in <<Depth-First Search for Binary Tree>>, depth-first search goes as deep as it can and then backs down visiting adjacent nodes.
 
-== Breadth First Search
+
+https://www.google.com/search?q=graph+dfs+vs+bfs&rlz=1C5CHFA_enUS818US818&source=lnms&tbm=isch&sa=X&ved=0ahUKEwimx4bs-uHgAhVNeKwKHS-aATMQ_AUIDigB&biw=1384&bih=977#imgrc=oGB49w2DS4afkM:
+
+== Breadth-First Search
 
 Irure ipsum deserunt culpa cillum deserunt. Adipisicing officia cillum culpa reprehenderit ullamco nulla irure. Ad nostrud excepteur eiusmod magna nostrud magna irure velit veniam sunt labore qui. Esse pariatur ullamco laborum sint. Eiusmod anim consectetur est eiusmod do ullamco est duis qui magna. Esse laboris ea quis id tempor laboris incididunt incididunt quis consectetur. Id esse enim excepteur magna ut.

book/chapters/tree--search.adoc

@@ -27,7 +27,7 @@ Why do we care? Well, there are certain problems that you solve more optimally u
 
 Let's cover Breadth-first search (BFS) and Depth-first search (DFS).
 
-== Breadth-First Search
+== Breadth-First Search for Binary Tree
 
 Breadth-first search goeas wide (breadth) before going deep. Hence, the name. In other words, it goes level by level. It visits all the inmediate nodes or children and then move on to the children's children.
 Let's how can we implement it!
@@ -76,7 +76,7 @@ console.log(Array.from(dummyIdMaker())); // [0, 1, 2]
 
 ****
 
-== Depth-First Search
+== Depth-First Search for Binary Tree
 
 Depth-First search goes deep before going wide. It means, that starting for the root it goes as deep as it can until it found a leaf node (node without children), then it visits all the remaing nodes that were in the path.