| Package | Description |
|---|---|
| com.graphhopper.routing | |
| com.graphhopper.routing.subnetwork | |
| com.graphhopper.routing.util | |
| com.graphhopper.storage | |
| com.graphhopper.storage.index | |
| com.graphhopper.util |
| Modifier and Type | Field and Description |
|---|---|
protected EdgeFilter |
AbstractRoutingAlgorithm.additionalEdgeFilter |
| Modifier and Type | Method and Description |
|---|---|
EdgeExplorer |
QueryGraph.createEdgeExplorer(EdgeFilter edgeFilter) |
RoutingAlgorithm |
AbstractRoutingAlgorithm.setEdgeFilter(EdgeFilter additionalEdgeFilter) |
| Constructor and Description |
|---|
TarjansSCCAlgorithm(GraphHopperStorage ghStorage,
EdgeFilter edgeFilter,
boolean ignoreSingleEntries) |
| Modifier and Type | Class and Description |
|---|---|
class |
DefaultEdgeFilter |
class |
IgnoreNodeFilter |
class |
LevelEdgeFilter
Only accepts edges leading to equal and higher level nodes.
|
class |
NameSimilarityEdgeFilter
This class defines the basis for NameSimilarity matching using an EdgeFilter.
|
| Modifier and Type | Field and Description |
|---|---|
static EdgeFilter |
EdgeFilter.ALL_EDGES |
| Modifier and Type | Method and Description |
|---|---|
List<QueryResult> |
TestAlgoCollector.OneRun.getList(LocationIndex idx,
EdgeFilter edgeFilter) |
| Constructor and Description |
|---|
NameSimilarityEdgeFilter(EdgeFilter edgeFilter,
String pointHint) |
NameSimilarityEdgeFilter(EdgeFilter edgeFilter,
String pointHint,
Map<String,String> rewriteMap) |
| Modifier and Type | Method and Description |
|---|---|
EdgeExplorer |
GraphHopperStorage.createEdgeExplorer(EdgeFilter filter) |
CHEdgeExplorer |
CHGraphImpl.createEdgeExplorer(EdgeFilter filter) |
EdgeExplorer |
Graph.createEdgeExplorer(EdgeFilter filter)
Returns an EdgeExplorer which makes it possible to traverse all filtered edges of a specific
node.
|
CHEdgeExplorer |
CHGraph.createEdgeExplorer(EdgeFilter filter) |
void |
GraphEdgeIdFinder.fillEdgeIDs(GHIntHashSet edgeIds,
com.vividsolutions.jts.geom.Geometry geometry,
EdgeFilter filter)
This method fills the edgeIds hash with edgeIds found inside the specified geometry
|
void |
GraphEdgeIdFinder.findClosestEdge(GHIntHashSet edgeIds,
double lat,
double lon,
EdgeFilter filter)
This method fills the edgeIds hash with edgeIds found close (exact match) to the specified lat,lon
|
void |
GraphEdgeIdFinder.findClosestEdgeToPoint(GHIntHashSet edgeIds,
GHPoint point,
EdgeFilter filter)
This method fills the edgeIds hash with edgeIds found close (exact match) to the specified point
|
void |
GraphEdgeIdFinder.findEdgesInShape(GHIntHashSet edgeIds,
Shape shape,
EdgeFilter filter)
This method fills the edgeIds hash with edgeIds found inside the specified shape
|
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.
|
| Modifier and Type | Method and Description |
|---|---|
QueryResult |
LocationIndex.findClosest(double lat,
double lon,
EdgeFilter edgeFilter)
This method returns the closest QueryResult for the specified location (lat, lon) and only if
the filter accepts the edge as valid candidate (e.g.
|
QueryResult |
Location2IDFullWithEdgesIndex.findClosest(double queryLat,
double queryLon,
EdgeFilter filter) |
QueryResult |
Location2IDFullIndex.findClosest(double queryLat,
double queryLon,
EdgeFilter edgeFilter) |
QueryResult |
LocationIndexTree.findClosest(double queryLat,
double queryLon,
EdgeFilter edgeFilter) |
List<QueryResult> |
LocationIndexTree.findNClosest(double queryLat,
double queryLon,
EdgeFilter edgeFilter,
double radius)
Returns all edges that are within the specified radius around the queried position.
|
| Constructor and Description |
|---|
XFirstSearchCheck(double queryLat,
double queryLon,
GHBitSet checkBitset,
EdgeFilter edgeFilter) |
| Modifier and Type | Method and Description |
|---|---|
static String |
GHUtility.getNodeInfo(CHGraph g,
int nodeId,
EdgeFilter filter) |
static String |
GHUtility.getNodeInfo(Graph g,
int nodeId,
EdgeFilter filter) |
static void |
GHUtility.printInfo(Graph g,
int startNode,
int counts,
EdgeFilter filter) |
Copyright © 2012–2018. All rights reserved.