From 0cfc261644d782551d665c9969a675d9aa449a46 Mon Sep 17 00:00:00 2001
From: bbod <bradybod@gmail.com>
Date: Mon, 30 Mar 2020 15:20:56 -0600
Subject: [PATCH] Auto Commit

---
 HW10/MakePermutationMatrix.cpp | 11 +++++------
 1 file changed, 5 insertions(+), 6 deletions(-)

diff --git a/HW10/MakePermutationMatrix.cpp b/HW10/MakePermutationMatrix.cpp
index 2dafb33..2f30d6c 100644
--- a/HW10/MakePermutationMatrix.cpp
+++ b/HW10/MakePermutationMatrix.cpp
@@ -13,7 +13,6 @@ std::vector<double> MakePermutationMatrix::MakePermutation(std::vector<City> sou
     std::sort(source.begin(), source.end());
     std::vector<City> myPerm = source;
     std::vector<City> nextPerm = source;
-    std::cout << "!!!!!!!!!!!!!! "<< myPerm.size() <<std::endl;
     auto offset = (myPerm.size()+1)/size;
 
     //return vector should be the size of number of processors as they are going to only return their own smallest.
@@ -38,11 +37,11 @@ std::vector<double> MakePermutationMatrix::MakePermutation(std::vector<City> sou
 //        std::cout << "rank " << rank << " source.size() " << source.size()  << std::endl;
 //        std::cout << "rank " << rank << " offset " << offset << std::endl;
 
-        for (int i = 1; i < myPerm.size(); i++) {
-            cost += costMatrix[myPerm[i].GetName()][myPerm[i-1].GetName()];
-            std::cout << myPerm[i].GetName() << " ";
-        }
-        std::cout << std::endl;
+//        for (int i = 1; i < myPerm.size(); i++) {
+//            cost += costMatrix[myPerm[i].GetName()][myPerm[i-1].GetName()];
+//            std::cout << myPerm[i].GetName() << " ";
+//        }
+//        std::cout << std::endl;
         //Push permutation cost to the localCostVector.
         localCostVector.push_back(cost);
     } while (std::next_permutation(myPerm.begin(), myPerm.end()) );