The Gaudi Framework  v36r9 (fd2bdac3)
concurrency::RankerByEccentricity Class Reference

#include </builds/gaudi/Gaudi/GaudiHive/src/PRGraph/Visitors/Rankers.h>

Inheritance diagram for concurrency::RankerByEccentricity:
Collaboration diagram for concurrency::RankerByEccentricity:

Public Member Functions

bool visit (AlgorithmNode &) override
 
virtual bool visit (DecisionNode &)
 
virtual bool visit (AlgorithmNode &)
 
virtual bool visit (DataNode &)
 
virtual bool visit (ConditionNode &)
 
- 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 &)
 
virtual void reset ()
 

Detailed Description

Definition at line 49 of file Rankers.h.

Member Function Documentation

◆ visit() [1/5]

virtual bool concurrency::IGraphVisitor::visit
inline

Definition at line 29 of file IGraphVisitor.h.

29 { return true; };

◆ visit() [2/5]

bool concurrency::RankerByEccentricity::visit ( AlgorithmNode node)
overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 118 of file Rankers.cpp.

118  {
119 
120  std::ifstream myfile;
121  myfile.open( "Eccentricity.graphml", std::ios::in );
122 
123  precedence::PrecTrace execPlan;
124 
125  boost::dynamic_properties dp;
126  using boost::get;
127 
128  dp.property( "name", get( &precedence::AlgoTraceProps::m_name, execPlan ) );
129  dp.property( "Eccentricity", get( &precedence::AlgoTraceProps::m_eccentricity, execPlan ) );
130 
131  boost::read_graphml( myfile, execPlan, dp );
132 
133  typedef boost::graph_traits<precedence::PrecTrace>::vertex_iterator itV;
135 
136  for ( vp = boost::vertices( execPlan ); vp.first != vp.second; ++vp.first ) {
137  precedence::AlgoTraceVertex v = *vp.first;
138  auto index = get( &precedence::AlgoTraceProps::m_name, execPlan );
139  if ( index[v] == node.name() ) {
140  auto index_eccentricity = get( &precedence::AlgoTraceProps::m_eccentricity, execPlan );
141  float rank = index_eccentricity[v];
142  node.setRank( rank );
143  // std::cout << "Rank of " << index[v] << " is " << rank << std::endl;
144  }
145  }
146  return true;
147  }

◆ visit() [3/5]

virtual bool concurrency::IGraphVisitor::visit
inline

Definition at line 35 of file IGraphVisitor.h.

35 { return true; };

◆ visit() [4/5]

virtual bool concurrency::IGraphVisitor::visit
inline

Definition at line 32 of file IGraphVisitor.h.

32 { return true; };

◆ visit() [5/5]

virtual bool concurrency::IGraphVisitor::visit
inline

Definition at line 26 of file IGraphVisitor.h.

26 { return true; };

The documentation for this class was generated from the following files:
std::pair
precedence::PrecTrace
boost::adjacency_list< boost::vecS, boost::vecS, boost::bidirectionalS, AlgoTraceProps > PrecTrace
Definition: PrecedenceRulesGraph.h:62
precedence::AlgoTraceVertex
boost::graph_traits< PrecTrace >::vertex_descriptor AlgoTraceVertex
Definition: PrecedenceRulesGraph.h:63
precedence::AlgoTraceProps::m_eccentricity
int m_eccentricity
Definition: PrecedenceRulesGraph.h:59
Gaudi::Functional::details::get
auto get(const Handle &handle, const Algo &, const EventContext &) -> decltype(details::deref(handle.get()))
Definition: FunctionalDetails.h:444
std::ifstream::open
T open(T... args)
HistoDumpEx.v
v
Definition: HistoDumpEx.py:27
precedence::AlgoTraceProps::m_name
std::string m_name
Definition: PrecedenceRulesGraph.h:54
std::ifstream
STL class.