1 #ifndef EFGRAPHVISITORS_H_ 2 #define EFGRAPHVISITORS_H_ 114 void runThroughAdjacents(boost::graph_traits<boost::ExecPlan>::vertex_descriptor vertex,
boost::ExecPlan graph);
~RankerByCummulativeOutDegree() override
Destructor.
bool visitLeave(DecisionNode &) const override
boost::adjacency_list< boost::vecS, boost::vecS, boost::bidirectionalS, AlgoNodeStruct > ExecPlan
bool visitEnter(AlgorithmNode &) const override
bool visitEnter(AlgorithmNode &) const override
RunSimulator(const int &slotNum)
Constructor.
bool visit(DecisionNode &) override
bool visitLeave(DecisionNode &) const override
bool visit(DecisionNode &) override
A visitor, performing full top-down traversals of a graph.
bool visitLeave(DecisionNode &) const override
~RankerByEccentricity() override
Destructor.
bool visitEnter(DecisionNode &) const override
RankerByCummulativeOutDegree()
Constructor.
~RankerByDataRealmEccentricity() override
Destructor.
~Trigger() override
Destructor.
bool visitEnter(DecisionNode &node) const override
bool visitLeave(DecisionNode &) const override
bool visitEnter(AlgorithmNode &) const override
bool visitEnter(DecisionNode &) const override
RankerByEccentricity()
Constructor.
bool visitEnter(AlgorithmNode &) const override
bool visitLeave(DecisionNode &node) const override
RankerByTiming()
Constructor.
bool visit(DecisionNode &) override
bool visitEnter(AlgorithmNode &) const override
bool visitLeave(DecisionNode &) const override
bool visit(DecisionNode &) override
bool visitEnter(DecisionNode &) const override
Trigger(const int &slotNum)
Constructor.
~RankerByProductConsumption() override
Destructor.
~RunSimulator() override
Destructor.
RankerByDataRealmEccentricity()
Constructor.
bool visitEnter(DecisionNode &) const override
bool visitEnter(DecisionNode &) const override
bool visit(DecisionNode &) override
RankerByProductConsumption()
Constructor.
~RankerByTiming() override
Destructor.
bool visit(DecisionNode &node) override