3 files changed, 2 insertions, 2 deletions

diff --git a/src/main/scala/uk/ac/ox/cs/rsacomb/approximation/approximation.scala b/src/main/scala/uk/ac/ox/cs/rsacomb/approximation/Approximation.scala
index 344f0fe..344f0fe 100644
--- a/src/main/scala/uk/ac/ox/cs/rsacomb/approximation/approximation.scala
+++ b/src/main/scala/uk/ac/ox/cs/rsacomb/approximation/Approximation.scala
diff --git a/src/main/scala/uk/ac/ox/cs/rsacomb/approximation/lowerbound.scala b/src/main/scala/uk/ac/ox/cs/rsacomb/approximation/Lowerbound.scala
index 766ea0e..3fc4988 100644
--- a/src/main/scala/uk/ac/ox/cs/rsacomb/approximation/lowerbound.scala
+++ b/src/main/scala/uk/ac/ox/cs/rsacomb/approximation/Lowerbound.scala
@@ -172,7 +172,7 @@ class LowerBound extends Approximation[RSAOntology] {
     * This is done by gathering those axioms that prevent the ontology
     * dependency graph from being tree-shaped, and removing them.
     *
-    * @param axioms the set of axioms to approximate.
+    * @param ontology the set of axioms to approximate.
     * @return the approximated RSA ontology
     */
   private def toRSA(ontology: Ontology): RSAOntology = {
@@ -214,7 +214,7 @@ class LowerBound extends Approximation[RSAOntology] {
       }
     }
 
-    val toDelete = color.iterator.collect { case (resource: IRI, ToDelete) =>
+    val toDelete = color.collect { case (resource: IRI, ToDelete) =>
       nodemap(resource.getIRI)
     }.toList
 
diff --git a/src/main/scala/uk/ac/ox/cs/rsacomb/ontologies/Ontology.scala b/src/main/scala/uk/ac/ox/cs/rsacomb/ontology/Ontology.scala
index d73704f..d73704f 100644
--- a/src/main/scala/uk/ac/ox/cs/rsacomb/ontologies/Ontology.scala
+++ b/src/main/scala/uk/ac/ox/cs/rsacomb/ontology/Ontology.scala