diff --git a/include/utils/Karger.hpp b/include/utils/Karger.hpp
index 0fcb983..18a4b1d 100644
--- a/include/utils/Karger.hpp
+++ b/include/utils/Karger.hpp
@@ -32,7 +32,6 @@ class Karger {
     int findMinCut(int);
     void setGraphEdges(std::list<std::list<int>>);
     void showGraphEdges(std::vector<Edge>);
-    void removeDuplicates();
     void createTxtOutput(std::map<int, float>, std::string);
 };
 
diff --git a/src/utils/Karger.cpp b/src/utils/Karger.cpp
index 1b96ba7..8fd3e25 100644
--- a/src/utils/Karger.cpp
+++ b/src/utils/Karger.cpp
@@ -161,7 +161,6 @@ void Karger::merge(int position){
         }
     }
 
-    removeDuplicates();
 }
 
 void Karger::calculateMinKarger(int executions){
@@ -284,26 +283,6 @@ int Karger::findMinCut(int executions) {
     return it->first;
 }
 
-void Karger::removeDuplicates(){
-
-    if(this->auxGraph.size() == 1){
-        return;
-    }
-    for(int i = 0; i < (this->auxGraph.size()); i++){
-        Edge oppositeDirection(this->auxGraph[i].getVertex2(),this->auxGraph[i].getVertex1());
-        if(this->auxGraph[i].getVertex2() == this->auxGraph[i].getVertex1()){
-            this->auxGraph.erase(this->auxGraph.begin()+i);
-        }
-        for(int j = i+1; j < (this->auxGraph.size()); j++){
-            if (this->auxGraph[i] == this->auxGraph[j]){
-                this->auxGraph.erase(this->auxGraph.begin()+j);
-            }else if(oppositeDirection == this->auxGraph[j]){
-                this->auxGraph.erase(this->auxGraph.begin()+j);
-            }
-        }
-    } 
-}
-
 void Karger::setGraphEdges(std::list<std::list<int>> adjacencyList){
     int count = 1;
     for (auto const& i : adjacencyList){