Modifier and Type | Field and Description |
---|---|
protected Graph |
AbstractRoutingAlgorithm.graph |
protected Graph |
AbstractNonCHBidirAlgo.graph |
Modifier and Type | Method and Description |
---|---|
static InstructionList |
InstructionsFromEdges.calcInstructions(Path path,
Graph graph,
Weighting weighting,
EncodedValueLookup evLookup,
Translation tr) |
RoutingAlgorithm |
RoutingAlgorithmFactory.createAlgo(Graph g,
AlgorithmOptions opts)
This method creates an algorithm out of this factory based on the specified opts and graph.
|
RoutingAlgorithm |
RoutingAlgorithmFactorySimple.createAlgo(Graph g,
AlgorithmOptions opts) |
protected BidirPathExtractor |
AbstractNonCHBidirAlgo.createPathExtractor(Graph graph,
Weighting weighting) |
static Path |
PathExtractor.extractPath(Graph graph,
Weighting weighting,
SPTEntry sptEntry) |
static Path |
BidirPathExtractor.extractPath(Graph graph,
Weighting weighting,
SPTEntry fwdEntry,
SPTEntry bwdEntry,
double weight) |
Modifier and Type | Method and Description |
---|---|
RoutingAlgorithm |
CHRoutingAlgorithmFactory.createAlgo(Graph graph,
AlgorithmOptions opts) |
Modifier and Type | Method and Description |
---|---|
RoutingAlgorithm |
LMRoutingAlgorithmFactory.createAlgo(Graph g,
AlgorithmOptions opts) |
Constructor and Description |
---|
LMApproximator(Graph graph,
Weighting weighting,
int maxBaseNodes,
LandmarkStorage lms,
int activeCount,
double factor,
boolean reverse) |
PerfectApproximator(Graph graph,
Weighting weighting,
TraversalMode traversalMode,
boolean reverse) |
Modifier and Type | Class and Description |
---|---|
class |
QueryGraph
A class which is used to query the underlying graph with real GPS points.
|
Modifier and Type | Method and Description |
---|---|
Graph |
QueryGraph.copyTo(Graph g) |
Graph |
QueryGraph.getBaseGraph() |
Graph |
QueryGraph.getMainGraph() |
Modifier and Type | Method and Description |
---|---|
Graph |
QueryGraph.copyTo(Graph g) |
static QueryGraph |
QueryGraph.create(Graph graph,
List<QueryResult> queryResults) |
static QueryGraph |
QueryGraph.create(Graph graph,
QueryResult qr) |
static QueryGraph |
QueryGraph.create(Graph graph,
QueryResult fromQR,
QueryResult toQR) |
Constructor and Description |
---|
EdgeBasedTarjanSCC(Graph graph,
BooleanEncodedValue accessEnc,
TurnCostProvider turnCostProvider,
boolean excludeSingleEdgeComponents) |
TarjanSCC(Graph graph,
BooleanEncodedValue accessEnc,
boolean excludeSingleNodeComponents) |
Modifier and Type | Method and Description |
---|---|
Graph |
TestAlgoCollector.AlgoHelperEntry.getForQueryGraph() |
Modifier and Type | Method and Description |
---|---|
void |
EncodingManager.handleTurnRelationTags(OSMTurnRelation turnRelation,
TurnCostParser.ExternalInternalMap map,
Graph graph) |
Constructor and Description |
---|
AlgoHelperEntry(Graph g,
AlgorithmOptions opts,
LocationIndex idx,
String expectedAlgo) |
Modifier and Type | Method and Description |
---|---|
void |
OSMTurnRelationParser.handleTurnRelationTags(OSMTurnRelation turnRelation,
TurnCostParser.ExternalInternalMap map,
Graph graph) |
void |
TurnCostParser.handleTurnRelationTags(OSMTurnRelation turnRelation,
TurnCostParser.ExternalInternalMap map,
Graph graph) |
Modifier and Type | Interface and Description |
---|---|
interface |
CHGraph
Extended graph interface which supports Contraction Hierarchies.
|
Modifier and Type | Class and Description |
---|---|
class |
CHGraphImpl
A Graph implementation necessary for Contraction Hierarchies.
|
class |
GraphHopperStorage
This class manages all storage related methods and delegates the calls to the associated graphs.
|
Modifier and Type | Method and Description |
---|---|
Graph |
GraphHopperStorage.copyTo(Graph g) |
Graph |
CHGraphImpl.copyTo(Graph g) |
Graph |
Graph.copyTo(Graph g)
Copy this Graph into the specified Graph g.
|
Graph |
RoutingCHGraph.getBaseGraph() |
Graph |
GraphHopperStorage.getBaseGraph() |
Graph |
CHGraphImpl.getBaseGraph() |
Graph |
Graph.getBaseGraph() |
Graph |
RoutingCHGraphImpl.getBaseGraph() |
Graph |
RoutingCHGraph.getGraph() |
Graph |
RoutingCHGraphImpl.getGraph() |
Modifier and Type | Method and Description |
---|---|
Graph |
GraphHopperStorage.copyTo(Graph g) |
Graph |
CHGraphImpl.copyTo(Graph g) |
Graph |
Graph.copyTo(Graph g)
Copy this Graph into the specified Graph g.
|
static GraphEdgeIdFinder.BlockArea |
GraphEdgeIdFinder.createBlockArea(Graph graph,
LocationIndex locationIndex,
List<GHPoint> points,
PMap hints,
EdgeFilter edgeFilter) |
Constructor and Description |
---|
BlockArea(Graph g) |
GraphEdgeIdFinder(Graph graph,
LocationIndex locationIndex) |
RoutingCHGraphImpl(Graph graph,
Weighting weighting) |
Modifier and Type | Field and Description |
---|---|
protected Graph |
LocationIndexTree.graph |
Constructor and Description |
---|
Location2IDFullIndex(Graph g) |
Location2IDFullWithEdgesIndex(Graph g) |
LocationIndexTree(Graph g,
Directory dir) |
Modifier and Type | Method and Description |
---|---|
static Graph |
GHUtility.copyTo(Graph fromGraph,
Graph toGraph) |
static Graph |
GHUtility.shuffle(Graph g,
Graph sortedGraph) |
static Graph |
GHUtility.sortDFS(Graph g,
Graph sortedGraph)
Sorts the graph according to depth-first search traversal.
|
Modifier and Type | Method and Description |
---|---|
static void |
GHUtility.addRandomTurnCosts(Graph graph,
long seed,
EncodingManager em,
FlagEncoder encoder,
int maxTurnCost,
TurnCostStorage turnCostStorage) |
static void |
GHUtility.buildRandomGraph(Graph graph,
Random random,
int numNodes,
double meanDegree,
boolean allowLoops,
boolean allowZeroDistance,
DecimalEncodedValue randomSpeedEnc,
double pNonZeroLoop,
double pBothDir,
double pRandomOffset) |
static Graph |
GHUtility.copyTo(Graph fromGraph,
Graph toGraph) |
static int |
GHUtility.getAdjNode(Graph g,
int edge,
int adjNode) |
static EdgeIteratorState |
GHUtility.getEdge(Graph graph,
int base,
int adj) |
static String |
GHUtility.getNodeInfo(Graph g,
int nodeId,
EdgeFilter filter) |
static List<String> |
GHUtility.getProblems(Graph g)
This method could throw an exception if problems like index out of bounds etc
|
static void |
GHUtility.printEdgeInfo(Graph g,
FlagEncoder encoder) |
static void |
GHUtility.printGraphForUnitTest(Graph g,
FlagEncoder encoder) |
static void |
GHUtility.printGraphForUnitTest(Graph g,
FlagEncoder encoder,
BBox bBox) |
static void |
GHUtility.printInfo(Graph g,
int startNode,
int counts,
EdgeFilter filter) |
static Graph |
GHUtility.shuffle(Graph g,
Graph sortedGraph) |
static Graph |
GHUtility.sortDFS(Graph g,
Graph sortedGraph)
Sorts the graph according to depth-first search traversal.
|
static void |
GHUtility.updateDistancesFor(Graph g,
int node,
double lat,
double lon) |
Constructor and Description |
---|
PathMerger(Graph graph,
Weighting weighting) |
Copyright © 2012–2020. All rights reserved.