glguy/aocpp
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fewer lookups in kahn's algorithm

Browse Source
This commit is contained in:
Eric Mertens 2022-11-09 15:45:55 -08:00
parent 35e31bf67f
commit 48da2e2805
1 changed files with 16 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
2019/14.cpp
View File

@ -45,27 +45,30 @@ auto Parse(std::istream & in) -> Recipes {
auto Topsort(Recipes const& recipes) -> std::vector<std::string>
{
// Kahn's algorithm
std::set<std::string> perm;
std::set<std::string> temp;
std::vector<std::string> result;
result.reserve(recipes.size());
auto visit_ = [&](auto& rec, std::string name) -> void {
if (!perm.contains(name)) {
if (!temp.insert(name).second) throw std::runtime_error{"cyclic recipes"};
if (recipes.contains(name)) {
for (auto && [_, c] : recipes.at(name).second) {
rec(rec, c);
std::map<std::string, bool> marks; // false temp, true done
auto const visit = [&](auto const& visit, auto const& name) -> void {
auto [mark_iterator, is_new] = marks.try_emplace(name, false);
auto& [_, is_done] = *mark_iterator;
if (is_new) {
auto const rit = recipes.find(name);
if (rit != recipes.end()) {
for (auto const& [_, c] : rit->second.second) {
visit(visit, c);
}
}
temp.erase(name);
perm.insert(name);
is_done = true;
result.push_back(name);
} else if (!is_done) {
throw std::runtime_error{"cyclic graph"};
}
};
auto visit = [&](auto name) { visit_(visit_, name); };
for (auto && [k,_] : recipes) {
visit(k);
for (auto const& [c,_] : recipes) {
visit(visit, c);
}
std::reverse(result.begin(), result.end());