DAG Class. More...
#include <DirectedAcyclicGraph.h>
Public Member Functions | |
| directed_acyclic_graph ()=default | |
| Constructor Function. | |
| virtual | ~directed_acyclic_graph ()=default |
| Destructor Function. | |
| void | add_node (directed_acyclic_node *node) |
| Add a node to this graph. | |
| void | execute () |
| Execute all node function by order. | |
| size_t | size () const |
| Get Node size. | |
Private Member Functions | |
| void | execute_internal (directed_acyclic_node *node, std::unordered_map< std::string, bool > &visited) |
| Execute a node's function. | |
Private Attributes | |
| std::unordered_map< std::string, directed_acyclic_node * > | m_Nodes |
| Graph Nodes. | |
DAG Class.
Definition at line 67 of file DirectedAcyclicGraph.h.