#include <src/PRGraphVisitors.h>

Inheritance diagram for concurrency::RankerByCummulativeOutDegree:

Collaboration diagram for concurrency::RankerByCummulativeOutDegree:

Public Member Functions
	RankerByCummulativeOutDegree ()
	Constructor. More...

	~RankerByCummulativeOutDegree () override
	Destructor. More...

bool	visitEnter (DecisionNode &) const override

bool	visit (DecisionNode &) override

bool	visitLeave (DecisionNode &) const override

bool	visitEnter (AlgorithmNode &) const override

bool	visit (AlgorithmNode &node) override

void	reset () override

void	runThroughAdjacents (boost::graph_traits< boost::ExecPlan >::vertex_descriptor vertex, boost::ExecPlan graph)

Public Member Functions inherited from concurrency::IGraphVisitor
virtual	~IGraphVisitor ()

Additional Inherited Members
Public Attributes inherited from concurrency::IGraphVisitor
int	m_nodesSucceeded

int	m_slotNum

Detailed Description

Definition at line 117 of file PRGraphVisitors.h.

Constructor & Destructor Documentation

concurrency::RankerByCummulativeOutDegree::RankerByCummulativeOutDegree ( )

inline

Constructor.

Definition at line 120 of file PRGraphVisitors.h.

                                      {
         m_nodesSucceeded = 0;
         m_slotNum = -1;
       };

concurrency::RankerByCummulativeOutDegree::~RankerByCummulativeOutDegree ( )

inlineoverride

Destructor.

Definition at line 125 of file PRGraphVisitors.h.

125 {}

Member Function Documentation

void concurrency::RankerByCummulativeOutDegree::reset ( )

inlineoverridevirtual

Implements concurrency::IGraphVisitor.

Definition at line 139 of file PRGraphVisitors.h.

139 { m_nodesSucceeded = 0; }

concurrency::IGraphVisitor::m_nodesSucceeded

int m_nodesSucceeded

Definition: IGraphVisitor.h:23

void concurrency::RankerByCummulativeOutDegree::runThroughAdjacents	(	boost::graph_traits< boost::ExecPlan >::vertex_descriptor	vertex,
		boost::ExecPlan	graph
	)

Definition at line 291 of file PRGraphVisitors.cpp.

                                                                                 {
       typename boost::graph_traits<boost::ExecPlan>::adjacency_iterator itVB;
       typename boost::graph_traits<boost::ExecPlan>::adjacency_iterator itVE;
 
       for (boost::tie(itVB, itVE) = adjacent_vertices(vertex, graph); itVB != itVE; ++itVB) {
         m_nodesSucceeded += 1;
         runThroughAdjacents(*itVB, graph);
       }
 
     }

bool concurrency::RankerByCummulativeOutDegree::visit ( DecisionNode & )

inlineoverridevirtual

Implements concurrency::IGraphVisitor.

Definition at line 129 of file PRGraphVisitors.h.

129 {return true;}

bool concurrency::RankerByCummulativeOutDegree::visit ( AlgorithmNode & node )

overridevirtual

Implements concurrency::IGraphVisitor.

Definition at line 256 of file PRGraphVisitors.cpp.

                                                                 {
 
       std::ifstream myfile;
       myfile.open("InputExecutionPlan.graphml", std::ios::in);
 
       boost::ExecPlan execPlan;
 
       boost::dynamic_properties dp;
       dp.property("name", boost::get(&boost::AlgoNodeStruct::m_name, execPlan));
       dp.property("index", boost::get(&boost::AlgoNodeStruct::m_index, execPlan));
       dp.property("dataRank", boost::get(&boost::AlgoNodeStruct::m_rank, execPlan));
       dp.property("runtime", boost::get(&boost::AlgoNodeStruct::m_runtime, execPlan));
 
       boost::read_graphml(myfile, execPlan, dp);
 
       typedef boost::graph_traits<boost::ExecPlan>::vertex_iterator itV;
       std::pair<itV, itV> vp;
       typedef boost::graph_traits<boost::ExecPlan>::vertex_descriptor AlgoVertex;
 
       for (vp = boost::vertices(execPlan); vp.first != vp.second; ++vp.first) {
         AlgoVertex v = *vp.first;
         auto index = boost::get(&boost::AlgoNodeStruct::m_name, execPlan);
         if (index[v] == node.getNodeName()) {
           runThroughAdjacents(v,execPlan);
           float rank = m_nodesSucceeded;
           node.setRank(rank);
           reset();
           //std::cout << "Rank of " << index[v] << " is " << rank << std::endl;
         }
       }
 
       return true;
     }