| Modifier and Type | Field and Description |
|---|---|
protected EdgeFilter |
AbstractNonCHBidirAlgo.additionalEdgeFilter |
| Modifier and Type | Method and Description |
|---|---|
protected EdgeFilter |
Router.Solver.createSnapFilter() |
| Modifier and Type | Method and Description |
|---|---|
protected void |
AbstractNonCHBidirAlgo.fillEdgesFromUsingFilter(EdgeFilter edgeFilter) |
protected void |
AbstractNonCHBidirAlgo.fillEdgesToUsingFilter(EdgeFilter edgeFilter) |
static List<Snap> |
ViaRouting.lookup(EncodedValueLookup lookup,
List<GHPoint> points,
EdgeFilter snapFilter,
LocationIndex locationIndex,
List<String> snapPreventions,
List<String> pointHints,
DirectedEdgeFilter directedSnapFilter,
List<Double> headings) |
static List<Snap> |
RoundTripRouting.lookup(List<GHPoint> points,
EdgeFilter edgeFilter,
LocationIndex locationIndex,
RoundTripRouting.Params params) |
| Modifier and Type | Method and Description |
|---|---|
EdgeExplorer |
QueryGraph.createEdgeExplorer(EdgeFilter edgeFilter) |
| Modifier and Type | Method and Description |
|---|---|
static TarjanSCC.ConnectedComponents |
TarjanSCC.findComponents(Graph graph,
EdgeFilter edgeFilter,
boolean excludeSingleNodeComponents)
Runs Tarjan's algorithm using an explicit stack.
|
static TarjanSCC.ConnectedComponents |
TarjanSCC.findComponentsRecursive(Graph graph,
EdgeFilter edgeFilter,
boolean excludeSingleNodeComponents)
Runs Tarjan's algorithm in a recursive way.
|
| Modifier and Type | Class and Description |
|---|---|
class |
AccessFilter |
class |
DefaultSnapFilter
This EdgeFilter combines the weighting result and the 'subnetwork' EncodedValue to consider the subnetwork removal
in LocationIndex lookup.
|
class |
FiniteWeightFilter
An
EdgeFilter that only accepts edges with finite weight (in either direction) |
class |
HeadingEdgeFilter |
class |
NameSimilarityEdgeFilter
This class defines the basis for NameSimilarity matching using an EdgeFilter.
|
class |
SnapPreventionEdgeFilter |
| Modifier and Type | Field and Description |
|---|---|
static EdgeFilter |
EdgeFilter.ALL_EDGES |
| Constructor and Description |
|---|
NameSimilarityEdgeFilter(EdgeFilter edgeFilter,
String pointHint,
GHPoint point,
double radius) |
NameSimilarityEdgeFilter(EdgeFilter edgeFilter,
String pointHint,
GHPoint point,
double radius,
Map<String,String> rewriteMap) |
SnapPreventionEdgeFilter(EdgeFilter filter,
EnumEncodedValue<RoadClass> rcEnc,
EnumEncodedValue<RoadEnvironment> reEnc,
List<String> snapPreventions) |
| Modifier and Type | Method and Description |
|---|---|
static GraphEdgeIdFinder.BlockArea |
GraphEdgeIdFinder.createBlockArea(Graph graph,
LocationIndex locationIndex,
List<GHPoint> points,
PMap hints,
EdgeFilter edgeFilter) |
EdgeExplorer |
Graph.createEdgeExplorer(EdgeFilter filter)
Returns an EdgeExplorer which makes it possible to traverse all filtered edges of a specific
node.
|
EdgeExplorer |
BaseGraph.createEdgeExplorer(EdgeFilter filter) |
GraphEdgeIdFinder.BlockArea |
GraphEdgeIdFinder.parseBlockArea(String blockAreaString,
EdgeFilter filter,
double useEdgeIdsUntilAreaSize)
This method reads the blockAreaString and creates a Collection of Shapes or a set of found edges if area is small enough.
|
| Constructor and Description |
|---|
EdgeIteratorImpl(BaseGraph baseGraph,
EdgeFilter filter) |
| Modifier and Type | Method and Description |
|---|---|
Snap |
LocationIndex.findClosest(double lat,
double lon,
EdgeFilter edgeFilter)
This method returns the closest Snap for the specified location (lat, lon) and only if
the filter accepts the edge as valid candidate (e.g.
|
Snap |
LocationIndexTree.findClosest(double queryLat,
double queryLon,
EdgeFilter edgeFilter) |
LocationIndex |
LocationIndexTree.prepareIndex(EdgeFilter edgeFilter) |
| Modifier and Type | Method and Description |
|---|---|
static List<Snap> |
GHUtility.createRandomSnaps(BBox bbox,
LocationIndex locationIndex,
Random rnd,
int numPoints,
boolean acceptTower,
EdgeFilter filter) |
static Snap |
GHUtility.getRandomSnap(LocationIndex locationIndex,
Random rnd,
BBox bbox,
EdgeFilter filter) |
Copyright © 2012–2022. All rights reserved.