bradybod-usu/cs5500_parallel_prog
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Auto Commit

Browse Source
This commit is contained in:
bbod
2020-03-30 11:19:19 -06:00
parent 1389a2f43b
commit e8f67d8dee
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
HW10/main.cpp
View File

@@ -28,6 +28,10 @@ int main(int argc, char* argv[])
// std::cout << std::endl; // std::cout << std::endl;
// } // }
flatMatrix = matrixTools::FlattenMatrix(costMatrix); flatMatrix = matrixTools::FlattenMatrix(costMatrix);
for(int i = 0; i < cities.size(); i++){
std::cout << cities[i].GetName() << " ";
}
std::cout << std::endl;
} }
MPI_Bcast(&citiesSize, 1, MPI_INT, 0, MPI_COMM_WORLD); MPI_Bcast(&citiesSize, 1, MPI_INT, 0, MPI_COMM_WORLD);
if(rank){ if(rank){
@@ -47,10 +51,6 @@ int main(int argc, char* argv[])
costMatrix = matrixTools::UnflattenMatrix(flatMatrix, citiesSize, citiesSize); costMatrix = matrixTools::UnflattenMatrix(flatMatrix, citiesSize, citiesSize);
//Make permutations //Make permutations
std::cout << "source size from main " << cities.size() << std::endl; std::cout << "source size from main " << cities.size() << std::endl;
for(int i = 0; i < cities.size(); i++){
std::cout << cities[i].GetName() << " ";
}
std::cout << std::endl;
costs = MakePermutationMatrix::GetLowestCost(cities, rank, size, costMatrix); costs = MakePermutationMatrix::GetLowestCost(cities, rank, size, costMatrix);
} }