67 bool sourcesStrict)
const;
69 bool keepShortestOnly,
int maxFollowingLength)
const;
116 bool keepUnfoundEnds,
117 bool keepShortestOnly,
120 int maxFollowingLength,
void mesoJoin(RODFDetectorCon &detectors, RODFDetectorFlows &flows)
void revalidateFlows(const RODFDetectorCon &detectors, RODFDetectorFlows &flows, SUMOTime startTime, SUMOTime endTime, SUMOTime stepOffset)
DFRouteDescByTimeComperator()
Constructor.
std::vector< std::string > myDisallowedEdges
List of ids of edges that shall not be used.
bool hasInBetweenDetectorsOnly(ROEdge *edge, const RODFDetectorCon &detectors) const
ROEdge * getDetectorEdge(const RODFDetector &det) const
bool isFalseSource(const RODFDetector &det, const RODFDetectorCon &detectors) const
bool operator()(ROEdge *const lhs, ROEdge *const rhs) const
bool isSource(const RODFDetector &det, const RODFDetectorCon &detectors, bool strict) const
std::map< ROEdge *, ROEdgeVector > myApproachedEdges
Map of edge name->list of names of edges approached by this edge.
void reportEmptyDetectors(RODFDetectorCon &detectors, RODFDetectorFlows &flows)
void computeTypes(RODFDetectorCon &dets, bool sourcesStrict) const
bool hasSourceDetector(ROEdge *edge, const RODFDetectorCon &detectors) const
A container for RODFDetectors.
bool hasDetector(ROEdge *edge) const
SUMOReal getAbsPos(const RODFDetector &det) const
~DFRouteDescByTimeComperator()
Destructor.
void buildRoutes(RODFDetectorCon &det, bool keepUnfoundEnds, bool includeInBetween, bool keepShortestOnly, int maxFollowingLength) const
comparator for maps using edges as key, used only in myDetectorsOnEdges to make tests comparable ...
bool isDestination(const RODFDetector &det, const RODFDetectorCon &detectors) const
const std::string & getID() const
Returns the id.
bool hasApproaching(ROEdge *edge) const
RODFNet(bool amInHighwayMode)
Constructor.
std::vector< ROEdge * > ROEdgeVector
const std::vector< std::string > & getDetectorList(ROEdge *edge) const
void buildDetectorEdgeDependencies(RODFDetectorCon &dets) 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
A route within the DFROUTER.
A basic edge for routing applications.
std::map< ROEdge *, ROEdgeVector > myApproachingEdges
Map of edge name->list of names of this edge approaching edges.
The router's network representation.
void buildEdgeFlowMap(const RODFDetectorFlows &flows, const RODFDetectorCon &detectors, SUMOTime startTime, SUMOTime endTime, SUMOTime stepOffset)
void buildDetectorDependencies(RODFDetectorCon &detectors)
Class representing a detector within the DFROUTER.
std::map< std::string, ROEdge * > myDetectorEdges
bool hasApproached(ROEdge *edge) const
A container for DFROUTER-routes.
std::map< ROEdge *, std::vector< std::string >, idComp > myDetectorsOnEdges
void removeEmptyDetectors(RODFDetectorCon &detectors, RODFDetectorFlows &flows)
bool operator()(const RODFRouteDesc &nod1, const RODFRouteDesc &nod2) const
Comparing method.