static void test_getShortestPermutation()
{
string[,] testMatrix = { { "1C", "1C", "BD", "55", "1C" },
{ "1C", "55", "BD", "1D", "1C" },
{ "1C", "1F", "FF", "1D", "1C" },
{ "1C", "E9", "FF", "1C", "BD" },
{ "1C", "1F", "1C", "1D", "1C" } };
List <string> hacks = new List <string>();
hacks.Add("55 1C");
hacks.Add("55 BD 1C");
hacks.Add("55 1C E9");
int bufferSize = 7;
MatrixSolver matrixSolver = new MatrixSolver(testMatrix, hacks, bufferSize);
List <List <string> > hackArrays =
new List <List <string> > {
new List <string> {
"1D", "1C"
},
new List <string> {
"1D", "BD", "1C"
},
new List <string> {
"1D", "1C", "E9"
}
};
List <List <string> > shortestSuperStrings = matrixSolver.findShortestSuperStrings(hackArrays);
matrixSolver.getShortestPermutation(shortestSuperStrings);
}
static void testFindShortestSuperString()
{
List <List <string> > hackArrays =
new List <List <string> > {
new List <string> {
"1C", "1C", "55"
},
new List <string> {
"55", "FF", "1C"
},
new List <string> {
"BD", "E9", "BD", "55"
},
new List <string> {
"55", "1C", "FF", "BD"
}
};
MatrixSolver matrixSolver = new MatrixSolver(new string[, ] {
});
matrixSolver.findShortestSuperStrings(hackArrays);
}
