diff --git a/CHANGELOG.md b/CHANGELOG.md
index f1268e21..4e021d32 100644
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -1,3 +1,10 @@
+## [2.7.6](https://github.com/amejiarosario/dsa.js/compare/2.7.5...2.7.6) (2021-11-30)
+
+
+### Bug Fixes
+
+* **graph:** minor typo in bfs code documentation ([ccfcfe6](https://github.com/amejiarosario/dsa.js/commit/ccfcfe6f039ce3f6e289d368fbdbf67e227c168c)), closes [#110](https://github.com/amejiarosario/dsa.js/issues/110)
+
 ## [2.7.5](https://github.com/amejiarosario/dsa.js/compare/2.7.4...2.7.5) (2021-05-24)
 
 
diff --git a/book/content/part03/tree-intro.asc b/book/content/part03/tree-intro.asc
index 80d65903..94f4b88b 100644
--- a/book/content/part03/tree-intro.asc
+++ b/book/content/part03/tree-intro.asc
@@ -106,6 +106,6 @@ image::image35.png[image,width=258,height=169]
 
 .Heap vs. Binary Search Tree
 ****
-Heap is better at finding max or min values in constant time *O(1)*, while a balanced BST is good a finding any element in *O(log n)*. Heaps are often used to implement priority queues, while BST is used when you need every value sorted.
+Heap is better at finding max or min values in constant time *O(1)*, while a balanced BST is good at finding any element in *O(log n)*. Heaps are often used to implement priority queues, while BST is used when you need every value sorted.
 ****
 indexterm:[Runtime, Logarithmic]
diff --git a/book/content/part04/quick-sort.asc b/book/content/part04/quick-sort.asc
index 4f1cd5e0..e1a1de65 100644
--- a/book/content/part04/quick-sort.asc
+++ b/book/content/part04/quick-sort.asc
@@ -13,7 +13,7 @@ Quicksort is an efficient recursive sorting algorithm that uses <<Divide and Con
 indexterm:[Divide and Conquer]
 In practice, quicksort outperforms other sorting algorithms like <<part04-algorithmic-toolbox#merge-sort>>. And, of course, It also outperforms simple sorting algorithms like <<part04-algorithmic-toolbox#selection-sort>>, <<part04-algorithmic-toolbox#insertion-sort>> and <<part04-algorithmic-toolbox#insertion-sort>>.
 
-Quicksort picks a "pivot" element randomly and moves all the smaller parts than the pivot to the right and the ones that are bigger to the left. It does this recursively until all the array is sorted.
+Quicksort picks a "pivot" element randomly and moves all the smaller parts than the pivot to the left and the ones that are bigger to the right. It does this recursively until all the array is sorted.
 
 ===== Quicksort Implementation
 
diff --git a/package-lock.json b/package-lock.json
index 1d1cca05..961f44f2 100644
--- a/package-lock.json
+++ b/package-lock.json
@@ -1,12 +1,12 @@
 {
   "name": "dsa.js",
-  "version": "2.7.5",
+  "version": "2.7.6",
   "lockfileVersion": 2,
   "requires": true,
   "packages": {
     "": {
       "name": "dsa.js",
-      "version": "2.7.4",
+      "version": "2.7.5",
       "license": "MIT",
       "devDependencies": {
         "@semantic-release/changelog": "^5.0.1",
diff --git a/package.json b/package.json
index 65e09fd3..73ef1563 100644
--- a/package.json
+++ b/package.json
@@ -1,6 +1,6 @@
 {
   "name": "dsa.js",
-  "version": "2.7.5",
+  "version": "2.7.6",
   "description": "Data Structures & Algorithms in JS",
   "author": "Adrian Mejia <hi+dsajs@adrianmejia.com> (https://adrianmejia.com)",
   "homepage": "https://github.com/amejiarosario/dsa.js",
diff --git a/src/data-structures/graphs/graph.js b/src/data-structures/graphs/graph.js
index 02b8d708..5342b6d3 100644
--- a/src/data-structures/graphs/graph.js
+++ b/src/data-structures/graphs/graph.js
@@ -134,7 +134,7 @@ class Graph {
   }
 
   /**
-   * Depth-first search
+   * Breadth-first search
    * Use a queue to visit nodes (FIFO)
    * @param {Node} first node to start the dfs
    */