From 1a3e56819937c8716fee1054e025ee463532be2c Mon Sep 17 00:00:00 2001
From: bbod <bradybod@gmail.com>
Date: Mon, 30 Mar 2020 18:07:00 -0600
Subject: [PATCH] Auto Commit

---
 HW10/MakePermutationMatrix.cpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/HW10/MakePermutationMatrix.cpp b/HW10/MakePermutationMatrix.cpp
index a3cfdd7..141202e 100644
--- a/HW10/MakePermutationMatrix.cpp
+++ b/HW10/MakePermutationMatrix.cpp
@@ -10,7 +10,7 @@
 std::vector<double> MakePermutationMatrix::MakePermutation(std::vector<City> source, int rank, int size, std::vector<std::vector<double>> costMatrix){
     std::vector<double> returnVector;
     std::vector<double> localCostVector;
-    std::size_t offset;
+    std::size_t offset = 12;
     std::sort(source.begin(), source.end());
     std::vector<City> myPerm = source;
     std::vector<City> nextPerm = source;
@@ -22,7 +22,7 @@ std::vector<double> MakePermutationMatrix::MakePermutation(std::vector<City> sou
         offset = totalNumPermutations/size;
         std::cout << "offset: "<<offset <<std::endl;
     }
-    MPI_Bcast(&offset, 1, MPI_LONG_LONG_INT, 0, MPI_COMM_WORLD);
+    //MPI_Bcast(&offset, 1, MPI_LONG_LONG_INT, 0, MPI_COMM_WORLD);
 
 
     //return vector should be the size of number of processors as they are going to only return their own smallest.