57 bool sourcesStrict)
const;
59 bool keepShortestOnly,
int maxFollowingLength)
const;
121 bool keepUnfoundEnds,
122 bool keepShortestOnly,
125 int maxFollowingLength,
std::vector< ROEdge * > ROEdgeVector
SUMOVehicleClass
Definition of vehicle classes to differ between different lane usage and authority types.
const std::string & getID() const
Returns the id.
A container for RODFDetectors.
Class representing a detector within the DFROUTER.
bool operator()(const RODFRouteDesc &nod1, const RODFRouteDesc &nod2) const
Comparing method.
~DFRouteDescByTimeComperator()
Destructor.
DFRouteDescByTimeComperator()
Constructor.
void buildEdgeFlowMap(const RODFDetectorFlows &flows, const RODFDetectorCon &detectors, SUMOTime startTime, SUMOTime endTime, SUMOTime stepOffset)
double getMaxSpeedFactorLKW() const
double myAvgSpeedFactorPKW
void computeTypes(RODFDetectorCon &dets, bool sourcesStrict) const
double getMaxSpeedFactorPKW() const
std::map< std::string, ROEdge * > myDetectorEdges
double myMaxSpeedFactorPKW
maximum speed factor in measurements
std::vector< std::string > myDisallowedEdges
List of ids of edges that shall not be used.
std::map< ROEdge *, std::vector< std::string >, idComp > myDetectorsOnEdges
void revalidateFlows(const RODFDetectorCon &detectors, RODFDetectorFlows &flows, SUMOTime startTime, SUMOTime endTime, SUMOTime stepOffset)
bool isFalseSource(const RODFDetector &det, const RODFDetectorCon &detectors) const
bool hasApproached(ROEdge *edge) const
void mesoJoin(RODFDetectorCon &detectors, RODFDetectorFlows &flows)
void buildDetectorEdgeDependencies(RODFDetectorCon &dets) const
bool hasApproaching(ROEdge *edge) const
void buildRoutes(RODFDetectorCon &det, bool keepUnfoundEnds, bool includeInBetween, bool keepShortestOnly, int maxFollowingLength) const
bool isDestination(const RODFDetector &det, const RODFDetectorCon &detectors) const
void buildDetectorDependencies(RODFDetectorCon &detectors)
SUMOVehicleClass myAllowedVClass
void removeEmptyDetectors(RODFDetectorCon &detectors, RODFDetectorFlows &flows)
bool isAllowed(const ROEdge *const edge) const
void computeRoutesFor(ROEdge *edge, RODFRouteDesc &base, int no, bool keepUnfoundEnds, bool keepShortestOnly, ROEdgeVector &visited, const RODFDetector &det, RODFRouteCont &into, const RODFDetectorCon &detectors, int maxFollowingLength, ROEdgeVector &seen) const
ROEdge * getDetectorEdge(const RODFDetector &det) const
double myMaxSpeedFactorLKW
bool hasSourceDetector(ROEdge *edge, const RODFDetectorCon &detectors) const
std::map< ROEdge *, ROEdgeVector > myApproachingEdges
Map of edge name->list of names of this edge approaching edges.
double getAvgSpeedFactorLKW() const
double getAvgSpeedFactorPKW() const
bool hasDetector(ROEdge *edge) const
const std::vector< std::string > & getDetectorList(ROEdge *edge) const
double getAbsPos(const RODFDetector &det) const
bool isSource(const RODFDetector &det, const RODFDetectorCon &detectors, bool strict) const
double myAvgSpeedFactorLKW
bool hasInBetweenDetectorsOnly(ROEdge *edge, const RODFDetectorCon &detectors) const
void reportEmptyDetectors(RODFDetectorCon &detectors, RODFDetectorFlows &flows)
std::map< ROEdge *, ROEdgeVector > myApproachedEdges
Map of edge name->list of names of edges approached by this edge.
A container for DFROUTER-routes.
A basic edge for routing applications.
The router's network representation.
comparator for maps using edges as key, used only in myDetectorsOnEdges to make tests comparable
bool operator()(ROEdge *const lhs, ROEdge *const rhs) const
A route within the DFROUTER.