concurrency::RankerByCummulativeOutDegree Class Reference

#include <src/PRGraphVisitors.h>

Inheritance diagram for concurrency::RankerByCummulativeOutDegree:

Collaboration diagram for concurrency::RankerByCummulativeOutDegree:

Public Member Functions
	RankerByCummulativeOutDegree ()
	Constructor. More...
bool	visit (AlgorithmNode &node) override
void	runThroughAdjacents (boost::graph_traits< boost::ExecPlan >::vertex_descriptor vertex, boost::ExecPlan graph)
Public Member Functions inherited from concurrency::IGraphVisitor
virtual	~IGraphVisitor ()=default
virtual bool	visitEnter (DecisionNode &) const
virtual bool	visit (DecisionNode &)
virtual bool	visitEnter (AlgorithmNode &) const
virtual bool	visitEnter (DataNode &) const
virtual bool	visit (DataNode &)
virtual void	reset ()

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

Detailed Description

Definition at line 73 of file PRGraphVisitors.h.

Constructor & Destructor Documentation

concurrency::RankerByCummulativeOutDegree::RankerByCummulativeOutDegree ( )

inline

Constructor.

Definition at line 76 of file PRGraphVisitors.h.

                                     {
        m_nodesSucceeded = 0;
        m_slot = nullptr;
      };

Member Function Documentation

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

Definition at line 232 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 ( AlgorithmNode &  node )

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 197 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;
  }

---

The documentation for this class was generated from the following files:

• GaudiHive/src/PRGraphVisitors.h
• GaudiHive/src/PRGraphVisitors.cpp