Package | Description |
---|---|
org.opentripplanner.analyst.batch | |
org.opentripplanner.analyst.request | |
org.opentripplanner.api.common | |
org.opentripplanner.api.parameter |
This package contains classes which interpret incoming HTTP query parameters.
|
org.opentripplanner.api.resource |
This package contains the JAX-RS-annotated REST resource classes for the OpenTripPlanner public
API, i.e.
|
org.opentripplanner.graph_builder | |
org.opentripplanner.graph_builder.linking | |
org.opentripplanner.internals | |
org.opentripplanner.routing.algorithm | |
org.opentripplanner.routing.algorithm.strategies | |
org.opentripplanner.routing.core | |
org.opentripplanner.routing.edgetype | |
org.opentripplanner.routing.edgetype.flex | |
org.opentripplanner.routing.flex | |
org.opentripplanner.routing.graph | |
org.opentripplanner.routing.impl | |
org.opentripplanner.routing.services | |
org.opentripplanner.routing.spt | |
org.opentripplanner.scripting.api | |
org.opentripplanner.standalone |
Constructor and Description |
---|
GraphGeographicFilter(RoutingRequest prototypeRoutingRequest,
GraphService graphService) |
Modifier and Type | Method and Description |
---|---|
List<IsochroneData> |
IsoChroneSPTRendererRecursiveGrid.getIsochrones(IsoChroneRequest isoChroneRequest,
RoutingRequest sptRequest) |
List<IsochroneData> |
IsoChroneSPTRenderer.getIsochrones(IsoChroneRequest isoChroneRequest,
RoutingRequest sptRequest) |
List<IsochroneData> |
IsoChroneSPTRendererAccSampling.getIsochrones(IsoChroneRequest isoChroneRequest,
RoutingRequest sptRequest) |
ZSampleGrid<SampleGridRenderer.WTWD> |
SampleGridRenderer.getSampleGrid(SampleGridRequest spgRequest,
RoutingRequest sptRequest) |
Modifier and Type | Method and Description |
---|---|
protected RoutingRequest |
RoutingResource.buildRequest()
Range/sanity check the query parameter fields and build a Request object from them.
|
Modifier and Type | Method and Description |
---|---|
void |
QualifiedModeSet.applyToRoutingRequest(RoutingRequest req)
Modify an existing routing request, setting fields to reflect these qualified modes.
|
void |
QualifiedMode.applyToRoutingRequest(RoutingRequest req,
boolean usingTransit) |
Modifier and Type | Method and Description |
---|---|
static TripPlan |
GraphPathToTripPlanConverter.generatePlan(List<GraphPath> paths,
RoutingRequest request)
Generates a TripPlan from a set of paths
|
Modifier and Type | Method and Description |
---|---|
void |
GraphBuilder.addMode(RoutingRequest mo) |
Modifier and Type | Method and Description |
---|---|
void |
GraphBuilder.setModes(List<RoutingRequest> modeList) |
Modifier and Type | Method and Description |
---|---|
Vertex |
StreetSplitter.linkOriginDestination(GenericLocation location,
RoutingRequest options,
boolean endVertex)
Used to link origin and destination points to graph non destructively.
|
boolean |
StreetSplitter.linkToGraph(Vertex vertex,
TraverseMode traverseMode,
RoutingRequest options,
boolean destructiveSplitting,
boolean createSemiPermanentEdges)
Link a vertex into the graph to the closest edge that allows the traversal of the specified mode.
|
boolean |
StreetSplitter.linkToGraph(Vertex vertex,
TraverseModeSet traverseModeSet,
RoutingRequest options,
boolean destructiveSplitting,
boolean createSemiPermanentEdges)
Link this vertex into the graph (ie, connect the vertex to other vertices in the graph by creating one or more
new edges/vertexes which are then connected to the other vertices/edges of the graph.
|
Modifier and Type | Method and Description |
---|---|
static List<org.locationtech.jts.geom.Geometry> |
AnalysisUtils.getComponentPolygons(Graph graph,
RoutingRequest options,
long time)
Get polygons covering the components of the graph.
|
Modifier and Type | Method and Description |
---|---|
ShortestPathTree |
AStar.getShortestPathTree(RoutingRequest req)
Compute SPT using default timeout and termination strategy.
|
ShortestPathTree |
EarliestArrivalSearch.getShortestPathTree(RoutingRequest req) |
ShortestPathTree |
AStar.getShortestPathTree(RoutingRequest req,
double relTimeoutSeconds)
Compute SPT using default termination strategy.
|
ShortestPathTree |
EarliestArrivalSearch.getShortestPathTree(RoutingRequest req,
double timeoutSeconds) |
ShortestPathTree |
AStar.getShortestPathTree(RoutingRequest options,
double relTimeoutSeconds,
SearchTerminationStrategy terminationStrategy) |
ShortestPathTree |
EarliestArrivalSearch.getShortestPathTree(RoutingRequest options,
double relTimeout,
SearchTerminationStrategy terminationStrategy) |
ShortestPathTree |
AStar.getShortestPathTree(RoutingRequest options,
double relTimeoutSeconds,
SearchTerminationStrategy terminationStrategy,
Collection<State> initialStates)
Get an SPT, starting from a collection of states
|
void |
AStar.startSearch(RoutingRequest options,
SearchTerminationStrategy terminationStrategy,
long abortTime)
set up a single-origin search
|
Constructor and Description |
---|
GenericDijkstra(RoutingRequest options) |
Modifier and Type | Method and Description |
---|---|
void |
InterleavedBidirectionalHeuristic.initialize(RoutingRequest request,
long abortTime)
Before the main search begins, the heuristic must search on the streets around the origin and destination.
|
void |
RemainingWeightHeuristic.initialize(RoutingRequest options,
long abortTime)
Perform any one-time setup and pre-computation that will be needed by later calls to
computeForwardWeight/computeReverseWeight.
|
void |
TrivialRemainingWeightHeuristic.initialize(RoutingRequest options,
long abortTime) |
void |
EuclideanRemainingWeightHeuristic.initialize(RoutingRequest options,
long abortTime) |
boolean |
SearchTerminationStrategy.shouldSearchTerminate(Vertex origin,
Vertex target,
State current,
ShortestPathTree spt,
RoutingRequest traverseOptions) |
boolean |
MultiTargetTerminationStrategy.shouldSearchTerminate(Vertex origin,
Vertex target,
State current,
ShortestPathTree spt,
RoutingRequest traverseOptions)
Updates the list of reached targets and returns True if all the
targets have been reached.
|
boolean |
SkipEdgeStrategy.shouldSkipEdge(Vertex origin,
Vertex target,
State current,
Edge edge,
ShortestPathTree spt,
RoutingRequest traverseOptions) |
boolean |
SkipTraverseResultStrategy.shouldSkipTraversalResult(Vertex origin,
Vertex target,
State parent,
State current,
ShortestPathTree spt,
RoutingRequest traverseOptions) |
Modifier and Type | Field and Description |
---|---|
RoutingRequest |
RoutingRequest.bikeWalkingOptions
Options specifically for the case that you are walking a bicycle.
|
RoutingRequest |
RoutingContext.opt |
protected RoutingRequest |
StateData.opt |
Modifier and Type | Method and Description |
---|---|
RoutingRequest |
RoutingRequest.clone() |
RoutingRequest |
State.getOptions() |
RoutingRequest |
RoutingRequest.reversedClone() |
Modifier and Type | Method and Description |
---|---|
protected int |
AbstractIntersectionTraversalCostModel.calculateTurnAngle(StreetEdge from,
StreetEdge to,
RoutingRequest options)
Calculates the turn angle from the incoming/outgoing edges and routing request.
|
double |
ConstantIntersectionTraversalCostModel.computeTraversalCost(IntersectionVertex v,
StreetEdge from,
StreetEdge to,
TraverseMode mode,
RoutingRequest options,
float fromSpeed,
float toSpeed) |
double |
SimpleIntersectionTraversalCostModel.computeTraversalCost(IntersectionVertex v,
StreetEdge from,
StreetEdge to,
TraverseMode mode,
RoutingRequest options,
float fromSpeed,
float toSpeed) |
abstract double |
AbstractIntersectionTraversalCostModel.computeTraversalCost(IntersectionVertex v,
StreetEdge from,
StreetEdge to,
TraverseMode mode,
RoutingRequest options,
float fromSpeed,
float toSpeed) |
double |
IntersectionTraversalCostModel.computeTraversalCost(IntersectionVertex v,
StreetEdge from,
StreetEdge to,
TraverseMode mode,
RoutingRequest options,
float fromSpeed,
float toSpeed)
Compute the cost of turning onto "to" from "from".
|
boolean |
StateEditor.isMaxPreTransitTimeExceeded(RoutingRequest options) |
void |
StateEditor.setOptions(RoutingRequest options) |
boolean |
StateEditor.weHaveWalkedTooFar(RoutingRequest options) |
Constructor and Description |
---|
RoutingContext(RoutingRequest routingRequest,
Graph graph)
Constructor that automatically computes origin/target from RoutingRequest.
|
RoutingContext(RoutingRequest routingRequest,
Graph graph,
Collection<Vertex> temporaryVertices)
Constructor that automatically computes origin/target from RoutingRequest, and sets the
context's temporary vertices.
|
RoutingContext(RoutingRequest routingRequest,
Graph graph,
Vertex from,
Vertex to)
Constructor that takes to/from vertices as input.
|
State(RoutingRequest opt)
Create an initial state representing the beginning of a search for the given routing context.
|
State(Vertex vertex,
Edge backEdge,
long timeSeconds,
long startTime,
RoutingRequest options)
Create an initial state, forcing vertex, back edge, time and start time to the specified values.
|
State(Vertex vertex,
Edge backEdge,
long timeSeconds,
RoutingRequest options)
Create an initial state, forcing vertex, back edge and time to the specified values.
|
State(Vertex vertex,
long timeSeconds,
RoutingRequest options)
Create an initial state, forcing vertex and time to the specified values.
|
State(Vertex vertex,
RoutingRequest opt)
Create an initial state, forcing vertex to the specified value.
|
StateData(RoutingRequest options) |
StateEditor(RoutingRequest options,
Vertex v) |
TraversalRequirements(RoutingRequest options)
Construct from RoutingRequest.
|
Modifier and Type | Method and Description |
---|---|
double |
StreetEdge.calculateSpeed(RoutingRequest options,
TraverseMode traverseMode,
long timeMillis)
Calculate the speed appropriately given the RoutingRequest and traverseMode and the current wall clock time.
|
double |
StreetWithElevationEdge.calculateSpeed(RoutingRequest options,
TraverseMode traverseMode,
long timeMillis)
Override the calculateSpeed method, but only do special calculations for Micromobility.
|
long |
TransitBoardAlight.getExtraWeight(RoutingRequest options) |
Timetable |
TripPattern.getUpdatedTimetable(RoutingRequest req,
ServiceDay sd)
Rather than the scheduled timetable, get the one that has been updated with real-time updates.
|
double |
TransitBoardAlight.timeLowerBound(RoutingRequest options) |
double |
PatternHop.timeLowerBound(RoutingRequest options) |
double |
StreetEdge.timeLowerBound(RoutingRequest options) |
double |
PatternInterlineDwell.timeLowerBound(RoutingRequest options) |
double |
PatternDwell.timeLowerBound(RoutingRequest options) |
double |
SimpleTransfer.weightLowerBound(RoutingRequest rr) |
double |
TransitBoardAlight.weightLowerBound(RoutingRequest options) |
double |
StreetVehicleRentalLink.weightLowerBound(RoutingRequest options) |
double |
PatternHop.weightLowerBound(RoutingRequest options) |
double |
StreetEdge.weightLowerBound(RoutingRequest options) |
double |
StreetCarRentalLink.weightLowerBound(RoutingRequest options) |
double |
StreetTransitLink.weightLowerBound(RoutingRequest options) |
double |
PatternInterlineDwell.weightLowerBound(RoutingRequest options) |
double |
ParkAndRideLinkEdge.weightLowerBound(RoutingRequest options) |
double |
PatternDwell.weightLowerBound(RoutingRequest options) |
double |
StreetBikeRentalLink.weightLowerBound(RoutingRequest options) |
double |
StreetBikeParkLink.weightLowerBound(RoutingRequest options) |
Modifier and Type | Method and Description |
---|---|
long |
FlexTransitBoardAlight.getExtraWeight(RoutingRequest options) |
boolean |
TemporaryDirectPatternHop.isTrivial(RoutingRequest options) |
boolean |
PartialPatternHop.isTrivial(RoutingRequest options) |
double |
TemporaryDirectPatternHop.timeLowerBound(RoutingRequest options) |
double |
PartialPatternHop.timeLowerBound(RoutingRequest options) |
Modifier and Type | Method and Description |
---|---|
void |
GtfsFlexGraphModifier.createBackwardHops(RoutingRequest request)
Create temporary edges and vertices from the transit network to the destination.
|
void |
GtfsFlexGraphModifier.createDirectHop(RoutingRequest rr,
FlexPatternHop originalPatternHop,
TransitStop fromStop,
TransitStop toStop,
GraphPath path) |
void |
GtfsFlexGraphModifier.createForwardHops(RoutingRequest request)
Create temporary edges and vertices from the origin into the transit network.
|
protected TemporaryTransitStop |
GtfsFlexGraphModifier.getTemporaryStop(StreetVertex streetVertex,
State s,
RoutingContext rctx,
RoutingRequest options) |
protected TemporaryTransitStop |
GtfsFlexGraphModifier.getTemporaryStop(StreetVertex streetVertex,
State s,
RoutingContext rctx,
RoutingRequest options,
boolean forwards) |
TemporaryPartialPatternHop |
DeviatedRouteGraphModifier.makeHopNewFrom(RoutingRequest opt,
State state,
FlexPatternHop hop,
PatternDepartVertex from,
Stop fromStop) |
TemporaryPartialPatternHop |
FlagStopGraphModifier.makeHopNewFrom(RoutingRequest opt,
State state,
FlexPatternHop hop,
PatternDepartVertex from,
Stop fromStop) |
abstract TemporaryPartialPatternHop |
GtfsFlexGraphModifier.makeHopNewFrom(RoutingRequest opt,
State state,
FlexPatternHop hop,
PatternDepartVertex from,
Stop fromStop)
Create a new
FlexPatternHop with a new "from" location (from a new destination to the route). |
TemporaryPartialPatternHop |
DeviatedRouteGraphModifier.makeHopNewTo(RoutingRequest opt,
State state,
FlexPatternHop hop,
PatternArriveVertex to,
Stop toStop) |
TemporaryPartialPatternHop |
FlagStopGraphModifier.makeHopNewTo(RoutingRequest opt,
State state,
FlexPatternHop hop,
PatternArriveVertex to,
Stop toStop) |
abstract TemporaryPartialPatternHop |
GtfsFlexGraphModifier.makeHopNewTo(RoutingRequest opt,
State state,
FlexPatternHop hop,
PatternArriveVertex to,
Stop toStop)
Create a new
FlexPatternHop with a new "to" location (from the route to a new destination). |
TemporaryPartialPatternHop |
DeviatedRouteGraphModifier.shortenEnd(RoutingRequest opt,
State state,
TemporaryPartialPatternHop hop,
PatternStopVertex to,
Stop toStop) |
TemporaryPartialPatternHop |
FlagStopGraphModifier.shortenEnd(RoutingRequest opt,
State state,
TemporaryPartialPatternHop hop,
PatternStopVertex to,
Stop toStop) |
abstract TemporaryPartialPatternHop |
GtfsFlexGraphModifier.shortenEnd(RoutingRequest opt,
State state,
TemporaryPartialPatternHop hop,
PatternStopVertex to,
Stop toStop)
From an existing TemporaryPartialPatternHop which has a new "from" location, create a new
TemporaryPartialPatternHop with the same "from" location and a new "to" location.
|
protected void |
DeviatedRouteGraphModifier.streetSearch(RoutingRequest rr) |
protected void |
GtfsFlexGraphModifier.streetSearch(RoutingRequest rr) |
Constructor and Description |
---|
CarPermissionSearch(RoutingRequest opt,
boolean arriveBy) |
Modifier and Type | Method and Description |
---|---|
double |
Edge.timeLowerBound(RoutingRequest options)
Returns a lower bound on traversal time given the routing options.
|
double |
Edge.weightLowerBound(RoutingRequest options)
Returns a lower bound on edge weight given the routing options.
|
Modifier and Type | Method and Description |
---|---|
List<GraphPath> |
GraphPathFinder.getPaths(RoutingRequest options)
Repeatedly build shortest path trees, retaining the best path to the destination after each try.
|
List<GraphPath> |
GraphPathFinder.graphPathFinderEntryPoint(RoutingRequest request) |
Modifier and Type | Method and Description |
---|---|
Vertex |
StreetVertexIndexService.getVertexForLocation(GenericLocation loc,
RoutingRequest options,
boolean endVertex)
Finds the appropriate vertex for this location.
|
Modifier and Type | Field and Description |
---|---|
RoutingRequest |
ShortestPathTree.options |
Modifier and Type | Method and Description |
---|---|
RoutingRequest |
ShortestPathTree.getOptions() |
Modifier and Type | Method and Description |
---|---|
ShortestPathTree |
DominanceFunction.getNewShortestPathTree(RoutingRequest routingRequest)
Create a new shortest path tree using this function, considering whether it allows co-dominant States.
|
Constructor and Description |
---|
ShortestPathTree(RoutingRequest options,
DominanceFunction dominanceFunction) |
Modifier and Type | Field and Description |
---|---|
protected RoutingRequest |
OtpsRoutingRequest.req |
Constructor and Description |
---|
OtpsRoutingRequest(RoutingRequest req) |
Modifier and Type | Field and Description |
---|---|
RoutingRequest |
Router.defaultRoutingRequest |
Copyright © 2020. All rights reserved.