6TY4LNHHAUSZNFDN34CHUWMZSQN5I3LNOOSV457M44FDGZB76X4AC PathSet missing;std::set_difference(closure.begin(), closure.end(), present.begin(), present.end(),std::inserter(missing, missing.end()));
if (present.size() == closure.size()) return;Paths sorted = topoSortPaths(*store, closure);Paths missing;for (auto i = sorted.rbegin(); i != sorted.rend(); ++i)if (present.find(*i) == present.end()) missing.push_back(*i);