This class executes a TaskGraph by first topologically sorting them (Kahn's algorithm) then sequentially running them. More...
#include <imstkSequentialTaskGraphController.h>
Inheritance diagram for imstk::SequentialTaskGraphController:
Collaboration diagram for imstk::SequentialTaskGraphController:
Public Member Functions | |
| void | init () override |
| Sorts the computational nodes. | |
| void | execute () override |
| Executes the TaskGraph. | |
 Public Member Functions inherited from imstk::TaskGraphController | |
| virtual void | setTaskGraph (std::shared_ptr< TaskGraph > graph) |
| std::shared_ptr< TaskGraph > | getTaskGraph () const |
| bool | initialize () |
| Initialization of the TaskGraphController, good for anything the controller may need to do after it recieves input, before execution, but not do everytime execution is called. Returns if successful. | |
Additional Inherited Members | |
| Protected Attributes inherited from imstk::TaskGraphController | |
| std::shared_ptr< TaskGraph > | m_graph = nullptr |
Detailed Description
This class executes a TaskGraph by first topologically sorting them (Kahn's algorithm) then sequentially running them.
Definition at line 22 of file imstkSequentialTaskGraphController.h.
The documentation for this class was generated from the following files:
- Source/Common/TaskGraph/imstkSequentialTaskGraphController.h
- Source/Common/TaskGraph/imstkSequentialTaskGraphController.cpp
