return true;
}
- bool pruneEnumerationMatrix(std::vector<std::set<int>> &enumerationMatrix, const GraphData &needle, const GraphData &haystack, int &nextRow)
+ bool pruneEnumerationMatrix(std::vector<std::set<int>> &enumerationMatrix, const GraphData &needle, const GraphData &haystack, int &nextRow, bool allowOverlap)
{
bool didSomething = true;
while (didSomething)
for (int i = 0; i < int(enumerationMatrix.size()); i++) {
std::set<int> newRow;
for (int j : enumerationMatrix[i]) {
- if (checkEnumerationMatrix(enumerationMatrix, i, j, needle, haystack))
- newRow.insert(j);
- else
+ if (!checkEnumerationMatrix(enumerationMatrix, i, j, needle, haystack))
+ didSomething = true;
+ else if (!allowOverlap && haystack.usedNodes[j])
didSomething = true;
+ else
+ newRow.insert(j);
}
if (newRow.size() == 0)
return false;
void ullmannRecursion(std::vector<Solver::Result> &results, std::vector<std::set<int>> &enumerationMatrix, int iter, const GraphData &needle, GraphData &haystack, bool allowOverlap, int limitResults)
{
int i = -1;
- if (!pruneEnumerationMatrix(enumerationMatrix, needle, haystack, i))
+ if (!pruneEnumerationMatrix(enumerationMatrix, needle, haystack, i, allowOverlap))
return;
if (i < 0)