Execute a node's function.
30 {
31 visited[node->m_Name] = true;
32 for (auto& dep : node->m_Dependencies)
33 {
34 if (!visited[dep])
35 {
37 }
38 }
39 node->m_Func();
40 }
void execute_internal(directed_acyclic_node *node, std::unordered_map< std::string, bool > &visited)
Execute a node's function.
std::unordered_map< std::string, directed_acyclic_node * > m_Nodes
Graph Nodes.