![]() |
The Gaudi Framework
v27r0
|
Classes | |
class | AlgorithmNode |
class | ControlFlowNode |
class | DataNode |
class | DecisionNode |
class | ExecutionFlowGraph |
class | ExecutionFlowManager |
Manage the execution flow using an execution flow graph Once initialized, the graph is const and can be shared across events. More... | |
struct | IExecutionFlowGraph |
struct | IExecutionFlowManager |
class | IGraphVisitor |
class | RankerByCummulativeOutDegree |
class | RankerByDataRealmEccentricity |
class | RankerByEccentricity |
class | RankerByProductConsumption |
class | RankerByTiming |
class | RunSimulator |
class | Trigger |
A visitor, performing full top-down traversals of a graph. More... | |
Typedefs | |
typedef AlgsExecutionStates::State | State |
typedef std::unordered_map< std::string, AlgorithmNode * > | AlgoNodesMap |
typedef std::unordered_map< std::string, DecisionNode * > | DecisionHubsMap |
typedef std::unordered_map< std::string, DataNode * > | DataNodesMap |
typedef std::unordered_map< std::string, const DataObjectDescriptorCollection * > | AlgoInputsMap |
typedef std::unordered_map< std::string, const DataObjectDescriptorCollection * > | AlgoOutputsMap |
typedef std::unordered_map<std::string,const DataObjectDescriptorCollection*> concurrency::AlgoInputsMap |
Definition at line 262 of file ExecutionFlowGraph.h.
typedef std::unordered_map<std::string,AlgorithmNode*> concurrency::AlgoNodesMap |
Definition at line 259 of file ExecutionFlowGraph.h.
typedef std::unordered_map<std::string,const DataObjectDescriptorCollection*> concurrency::AlgoOutputsMap |
Definition at line 263 of file ExecutionFlowGraph.h.
typedef std::unordered_map<std::string,DataNode*> concurrency::DataNodesMap |
Definition at line 261 of file ExecutionFlowGraph.h.
typedef std::unordered_map<std::string,DecisionNode*> concurrency::DecisionHubsMap |
Definition at line 260 of file ExecutionFlowGraph.h.
Definition at line 43 of file ExecutionFlowGraph.h.