Skip to content

Resolve: removeDuplicates() method remove bias from Naive-Karger #3

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: dev
Choose a base branch
from
Open

Resolve: removeDuplicates() method remove bias from Naive-Karger #3

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 0 additions & 1 deletion include/utils/Karger.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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);
};

Expand Down
21 changes: 0 additions & 21 deletions src/utils/Karger.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -161,7 +161,6 @@ void Karger::merge(int position){
}
}

removeDuplicates();
}

void Karger::calculateMinKarger(int executions){
Expand Down Expand Up @@ -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){
Expand Down