#include <BaseMappingGraphNode.h>
Abstract base class for nodes in the mapping graph. More...

Abstract base class for nodes in the mapping graph.
Provides common functionality for tracking prerequisites (parents) and dependencies (children), forming a Directed Acyclic Graph (DAG). It implements the Visitor pattern.
Public Member Functions | |
| virtual | ~BaseMappingGraphNode ()=default |
| virtual void | accept (MappingGraphVisitor &visitor) const =0 |
| Accepts a visitor, allowing the graph to be processed by an external algorithm. More... | |
| virtual std::string | getName () const |
| Gets the name of the component represented by this node. More... | |
| virtual NodeType | getType () const =0 |
| bool | isMapped () const |
| const sofa::type::vector< SPtr > & | getParents () const |
| const sofa::type::vector< SPtr > & | getChildren () const |
Friends | |
| class | MappingGraph |
| struct | MappingGraphAlgorithms |
|
virtualdefault |
|
pure virtual |
Accepts a visitor, allowing the graph to be processed by an external algorithm.
| visitor | The concrete visitor implementation. |
Implemented in sofa::simulation::MappingGraphNode< TComponent >, and sofa::simulation::ComponentGroupMappingGraphNode.
|
inline |
|
inlinevirtual |
Gets the name of the component represented by this node.
Reimplemented in sofa::simulation::MappingGraphNode< TComponent >, and sofa::simulation::ComponentGroupMappingGraphNode.
|
inline |
|
pure virtual |
| bool sofa::simulation::BaseMappingGraphNode::isMapped | ( | ) | const |
|
strong |
|
friend |
|
friend |