Eclipse SUMO - Simulation of Urban MObility
Loading...
Searching...
No Matches
EffortCalculator Class Referenceabstract

the effort calculator interface More...

#include <EffortCalculator.h>

Inheritance diagram for EffortCalculator:
[legend]

Public Member Functions

virtual void addStop (const int stopEdge, const Parameterised &params)=0
 
virtual double getEffort (const int numericalID) const =0
 
virtual void init (const std::vector< std::string > &edges)=0
 
virtual std::string output (const int edge) const =0
 
virtual void setInitialState (const int edge)=0
 
virtual void update (const int edge, const int prev, const double length)=0
 
virtual ~EffortCalculator ()
 empty destructor
 

Detailed Description

the effort calculator interface

Definition at line 30 of file EffortCalculator.h.

Constructor & Destructor Documentation

◆ ~EffortCalculator()

virtual EffortCalculator::~EffortCalculator ( )
inlinevirtual

empty destructor

Definition at line 33 of file EffortCalculator.h.

Member Function Documentation

◆ addStop()

virtual void EffortCalculator::addStop ( const int  stopEdge,
const Parameterised params 
)
pure virtual

Add information about stops

Implemented in FareModul.

Referenced by MSNet::adaptIntermodalRouter().

Here is the caller graph for this function:

◆ getEffort()

virtual double EffortCalculator::getEffort ( const int  numericalID) const
pure virtual

Return the effort of a given edge

Implemented in FareModul.

Referenced by IntermodalRouter< E, L, N, V >::getCombined().

Here is the caller graph for this function:

◆ init()

virtual void EffortCalculator::init ( const std::vector< std::string > &  edges)
pure virtual

Pass the set of all edges in the routing query to the effortCalculator

Implemented in FareModul.

Referenced by IntermodalRouter< E, L, N, V >::createNet().

Here is the caller graph for this function:

◆ output()

virtual std::string EffortCalculator::output ( const int  edge) const
pure virtual

basic output facility to inform about effort at this edge

Implemented in FareModul.

Referenced by IntermodalRouter< E, L, N, V >::compute().

Here is the caller graph for this function:

◆ setInitialState()

virtual void EffortCalculator::setInitialState ( const int  edge)
pure virtual

Set the effort of the first edge in the query to zero

Implemented in FareModul.

Referenced by DijkstraRouter< E, V >::compute().

Here is the caller graph for this function:

◆ update()

virtual void EffortCalculator::update ( const int  edge,
const int  prev,
const double  length 
)
pure virtual

Update the effort of the edge

Implemented in FareModul.

Referenced by DijkstraRouter< E, V >::compute().

Here is the caller graph for this function:

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