concurrency::RankerByCummulativeOutDegree Class Reference

#include <src/PRGraphVisitors.h>

Inheritance diagram for concurrency::RankerByCummulativeOutDegree:

Collaboration diagram for concurrency::RankerByCummulativeOutDegree:

Public Member Functions
bool	visit (AlgorithmNode &) override
void	reset () override
void	runThroughAdjacents (boost::graph_traits< precedence::PrecTrace >::vertex_descriptor, precedence::PrecTrace)
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 bool	visitEnter (ConditionNode &) const
virtual bool	visit (ConditionNode &)

Public Attributes
int	m_nodesSucceeded {0}

Detailed Description

Definition at line 85 of file PRGraphVisitors.h.

Member Function Documentation

void concurrency::RankerByCummulativeOutDegree::reset ( )

inlineoverridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 91 of file PRGraphVisitors.h.

{ m_nodesSucceeded = 0; };

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

Definition at line 291 of file PRGraphVisitors.cpp.

  {
    typename boost::graph_traits<precedence::PrecTrace>::adjacency_iterator itVB;
    typename boost::graph_traits<precedence::PrecTrace>::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 253 of file PRGraphVisitors.cpp.

  {

    std::ifstream myfile;
    myfile.open( "InputExecutionPlan.graphml", std::ios::in );

    precedence::PrecTrace execPlan;

    using precedence::AlgoTraceProps;
    using boost::get;

    boost::dynamic_properties dp;
    dp.property( "name", get( &AlgoTraceProps::m_name, execPlan ) );
    dp.property( "index", get( &AlgoTraceProps::m_index, execPlan ) );
    dp.property( "dataRank", get( &AlgoTraceProps::m_rank, execPlan ) );
    dp.property( "runtime", get( &AlgoTraceProps::m_runtime, execPlan ) );

    boost::read_graphml( myfile, execPlan, dp );

    typedef boost::graph_traits<precedence::PrecTrace>::vertex_iterator itV;
    std::pair<itV, itV> vp;

    for ( vp = boost::vertices( execPlan ); vp.first != vp.second; ++vp.first ) {
      precedence::AlgoTraceVertex v = *vp.first;
      auto index                    = get( &AlgoTraceProps::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;
  }

Member Data Documentation

int concurrency::RankerByCummulativeOutDegree::m_nodesSucceeded {0}

Definition at line 95 of file PRGraphVisitors.h.

---

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

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