public class RaptorWorker extends Object
Modifier and Type | Field and Description |
---|---|
static int |
MONTE_CARLO_COUNT_PER_MINUTE
The number of randomized frequency schedule draws to take for each minute of the search.
|
static int |
TOTAL_MONTE_CARLO_COUNT
If there are no schedules, the number of Monte Carlo draws to take
|
static int |
UNREACHED |
Constructor and Description |
---|
RaptorWorker(RaptorWorkerData data,
ProfileRequest req) |
Modifier and Type | Method and Description |
---|---|
void |
advance() |
boolean |
doOneRound(int[] bestTimes,
int[] bestNonTransferTimes,
int[] previousPatterns,
boolean useFrequencies) |
void |
doPropagation(int[] timesAtTransitStops,
int[] timesAtTargets,
int departureTime)
Propagate from the transit network to the street network.
|
void |
dumpVariableByte(int[][] array) |
PropagatedTimesStore |
runRaptor(Graph graph,
gnu.trove.map.TIntIntMap accessTimes,
int[] nonTransitTimes,
TaskStatistics ts) |
void |
runRaptorFrequency(int departureTime,
int[] bestTimes,
int[] bestNonTransferTimes,
int[] previousPatterns)
Run a RAPTOR search using frequencies
|
void |
runRaptorScheduled(gnu.trove.map.TIntIntMap initialStops,
int departureTime)
Run a raptor search not using frequencies
|
public static final int UNREACHED
public static final int MONTE_CARLO_COUNT_PER_MINUTE
public static final int TOTAL_MONTE_CARLO_COUNT
public RaptorWorker(RaptorWorkerData data, ProfileRequest req)
public void advance()
public PropagatedTimesStore runRaptor(Graph graph, gnu.trove.map.TIntIntMap accessTimes, int[] nonTransitTimes, TaskStatistics ts)
accessTimes
- a map from transit stops to the time it takes to reach those stopsnonTransitTimes
- the time to reach all targets without transit. Targets can be vertices or points/samples.public void dumpVariableByte(int[][] array)
public void runRaptorScheduled(gnu.trove.map.TIntIntMap initialStops, int departureTime)
public void runRaptorFrequency(int departureTime, int[] bestTimes, int[] bestNonTransferTimes, int[] previousPatterns)
public boolean doOneRound(int[] bestTimes, int[] bestNonTransferTimes, int[] previousPatterns, boolean useFrequencies)
public void doPropagation(int[] timesAtTransitStops, int[] timesAtTargets, int departureTime)
Copyright © 2019. All rights reserved.