diff --git a/source/Mole/BreadthFirstTraversal.class.st b/source/Mole/BreadthFirstTraversal.class.st
index c7de31f..2fa344f 100644
--- a/source/Mole/BreadthFirstTraversal.class.st
+++ b/source/Mole/BreadthFirstTraversal.class.st
@@ -5,7 +5,7 @@ It starts at the tree root (or some arbitrary node of a graph), and explores all
 "
 Class {
 	#name : #BreadthFirstTraversal,
-	#superclass : #GraphTraversalAlgorithm,
+	#superclass : #GraphTraversal,
 	#category : #'Mole-Traversal'
 }
 
diff --git a/source/Mole/DepthFirstTraversal.class.st b/source/Mole/DepthFirstTraversal.class.st
index e29107f..3249368 100644
--- a/source/Mole/DepthFirstTraversal.class.st
+++ b/source/Mole/DepthFirstTraversal.class.st
@@ -5,7 +5,7 @@ The algorithm begins with a chosen ""root"" vertex; it then iteratively transiti
 "
 Class {
 	#name : #DepthFirstTraversal,
-	#superclass : #GraphTraversalAlgorithm,
+	#superclass : #GraphTraversal,
 	#category : #'Mole-Traversal'
 }
 
diff --git a/source/Mole/GraphTraversalAlgorithm.class.st b/source/Mole/GraphTraversal.class.st
similarity index 69%
rename from source/Mole/GraphTraversalAlgorithm.class.st
rename to source/Mole/GraphTraversal.class.st
index c87d810..a3128ed 100644
--- a/source/Mole/GraphTraversalAlgorithm.class.st
+++ b/source/Mole/GraphTraversal.class.st
@@ -2,13 +2,13 @@
 I'm an abstract class for the graph traversal algorithm; a process of visiting each vertex in a graph, allowing to do something with them.
 "
 Class {
-	#name : #GraphTraversalAlgorithm,
+	#name : #GraphTraversal,
 	#superclass : #Object,
 	#category : #'Mole-Traversal'
 }
 
 { #category : #traverse }
-GraphTraversalAlgorithm >> traverse: aGraph from: aSourceVertex doing: aBlock [
+GraphTraversal >> traverse: aGraph from: aSourceVertex doing: aBlock [
 
 	self subclassResponsibility
 ]