| The Gaudi Framework v30r0 (c919700c)

- Main Page
- Related Pages
- Modules
- Namespaces
- Classes
- Files

- Class List
- Class Index
- Class Hierarchy
- Class Members

Public Member Functions | List of all members
concurrency::RankerByEccentricity Class Reference

`#include <src/PRGraphVisitors.h>`

Inheritance diagram for concurrency::RankerByEccentricity:
[legend]
Collaboration diagram for concurrency::RankerByEccentricity:
[legend]

## Public Member Functions
bool | visit (AlgorithmNode &) override
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 106 of file PRGraphVisitors.h.

## Member Function Documentation

bool concurrency::RankerByEccentricity::visit | ( | AlgorithmNode & | node | ) |
| override virtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 339 of file PRGraphVisitors.cpp.

340 {
341
342 std::ifstream myfile;
343 myfile.open( "Eccentricity.graphml", std::ios::in );
344
345 precedence::PrecTrace execPlan;
346
347 boost::dynamic_properties dp;
348 using boost::get;
349
350 dp.property( "name", get( &precedence::AlgoTraceProps::m_name, execPlan ) );
351 dp.property( "Eccentricity", get( &precedence::AlgoTraceProps::m_eccentricity, execPlan ) );
352
353 boost::read_graphml( myfile, execPlan, dp );
354
355 typedef boost::graph_traits<precedence::PrecTrace>::vertex_iterator itV;
356 std::pair<itV, itV> vp;
357
358 for ( vp = boost::vertices( execPlan ); vp.first != vp.second; ++vp.first ) {
359 precedence::AlgoTraceVertex v = *vp.first;
360 auto index = get( &precedence::AlgoTraceProps::m_name, execPlan );
361 if ( index[v] == node.getNodeName() ) {
362 auto index_eccentricity = get( &precedence::AlgoTraceProps::m_eccentricity, execPlan );
363 float rank = index_eccentricity[v];
364 node.setRank( rank );
365 // std::cout << "Rank of " << index[v] << " is " << rank << std::endl;
366 }
367 }
368 return true;
369 }
std::ifstream::open
T open(T...args)
precedence::AlgoTraceVertex
boost::graph_traits< PrecTrace >::vertex_descriptor AlgoTraceVertex
Definition: PrecedenceRulesGraph.h:56
precedence::AlgoTraceProps::m_eccentricity
int m_eccentricity
Definition: PrecedenceRulesGraph.h:52
precedence::PrecTrace
boost::adjacency_list< boost::vecS, boost::vecS, boost::bidirectionalS, AlgoTraceProps > PrecTrace
Definition: PrecedenceRulesGraph.h:55
std::pair
GaudiPython.Persistency.get
def get(type_)
Definition: Persistency.py:29
precedence::AlgoTraceProps::m_name
std::string m_name
Definition: PrecedenceRulesGraph.h:48
std::ifstream
STL class.

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

- GaudiHive/src/PRGraphVisitors.h
- GaudiHive/src/PRGraphVisitors.cpp