Uses of Interface
com.graphhopper.storage.Graph

Packages that use Graph

Package	Description
com.graphhopper
com.graphhopper.routing
com.graphhopper.routing.ch
com.graphhopper.routing.lm
com.graphhopper.routing.util
com.graphhopper.storage
com.graphhopper.storage.change
com.graphhopper.storage.index
com.graphhopper.util

Uses of Graph in com.graphhopper

Methods in com.graphhopper with parameters of type Graph

Modifier and Type	Method and Description
protected ChangeGraphHelper	GraphHopper.createChangeGraphHelper(Graph graph, LocationIndex locationIndex)
Weighting	GraphHopper.createTurnWeighting(Graph graph, Weighting weighting, TraversalMode tMode) Potentially wraps the specified weighting into a TurnWeighting instance.
Weighting	GraphHopper.createWeighting(HintsMap hintsMap, FlagEncoder encoder, Graph graph) Based on the hintsMap and the specified encoder a Weighting instance can be created.

Uses of Graph in com.graphhopper.routing

Classes in com.graphhopper.routing that implement Graph

Modifier and Type	Class and Description
class	QueryGraph A class which is used to query the underlying graph with real GPS points.

Fields in com.graphhopper.routing declared as Graph

Modifier and Type	Field and Description
protected Graph	Path.graph
protected Graph	AbstractRoutingAlgorithm.graph

Methods in com.graphhopper.routing that return Graph

Modifier and Type	Method and Description
Graph	QueryGraph.copyTo(Graph g)
Graph	QueryGraph.getBaseGraph()

Methods in com.graphhopper.routing with parameters of type Graph

Modifier and Type	Method and Description
Graph	QueryGraph.copyTo(Graph g)
RoutingAlgorithm	RoutingAlgorithmFactorySimple.createAlgo(Graph g, AlgorithmOptions opts)
RoutingAlgorithm	RoutingAlgorithmFactory.createAlgo(Graph g, AlgorithmOptions opts) This method creates an algorithm out of this factory based on the specified opts and graph.

Constructors in com.graphhopper.routing with parameters of type Graph

Constructor and Description
AbstractBidirAlgo(Graph graph, Weighting weighting, TraversalMode tMode)
AbstractRoutingAlgorithm(Graph graph, Weighting weighting, TraversalMode traversalMode)
AlternativeBidirSearch(Graph graph, Weighting weighting, TraversalMode tMode, double explorationFactor)
AlternativeRoute(Graph graph, Weighting weighting, TraversalMode traversalMode)
AStar(Graph graph, Weighting weighting, TraversalMode tMode)
AStarBidirection(Graph graph, Weighting weighting, TraversalMode tMode)
AStarBidirectionCH(Graph graph, Weighting weighting, TraversalMode traversalMode)
Dijkstra(Graph graph, Weighting weighting, TraversalMode tMode)
DijkstraBidirectionCH(Graph graph, Weighting weighting, TraversalMode traversalMode)
DijkstraBidirectionCHNoSOD(Graph graph, Weighting weighting, TraversalMode traversalMode)
DijkstraBidirectionRef(Graph graph, Weighting weighting, TraversalMode tMode)
DijkstraOneToMany(Graph graph, Weighting weighting, TraversalMode tMode)
InstructionsFromEdges(int tmpNode, Graph graph, Weighting weighting, FlagEncoder encoder, NodeAccess nodeAccess, Translation tr, InstructionList ways)
Path(Graph graph, Weighting weighting)
PathBidirRef(Graph g, Weighting weighting)
PathNative(Graph g, Weighting weighting, int[] parentNodes, int[] parentEdges)
QueryGraph(Graph graph)

Uses of Graph in com.graphhopper.routing.ch

Methods in com.graphhopper.routing.ch with parameters of type Graph

Modifier and Type	Method and Description
RoutingAlgorithm	PrepareContractionHierarchies.createAlgo(Graph graph, AlgorithmOptions opts)

Constructors in com.graphhopper.routing.ch with parameters of type Graph

Constructor and Description
Path4CH(Graph routingGraph, Graph baseGraph, Weighting weighting)

Uses of Graph in com.graphhopper.routing.lm

Methods in com.graphhopper.routing.lm with parameters of type Graph

Modifier and Type	Method and Description
RoutingAlgorithm	LMAlgoFactoryDecorator.LMRAFactory.createAlgo(Graph g, AlgorithmOptions opts)
RoutingAlgorithm	PrepareLandmarks.getDecoratedAlgorithm(Graph qGraph, RoutingAlgorithm algo, AlgorithmOptions opts)

Constructors in com.graphhopper.routing.lm with parameters of type Graph

Constructor and Description
LMApproximator(Graph graph, int maxBaseNodes, LandmarkStorage lms, int activeCount, double factor, boolean reverse)

Uses of Graph in com.graphhopper.routing.util

Methods in com.graphhopper.routing.util that return Graph

Modifier and Type	Method and Description
Graph	TestAlgoCollector.AlgoHelperEntry.getForQueryGraph()

Constructors in com.graphhopper.routing.util with parameters of type Graph

Constructor and Description
AlgoHelperEntry(Graph g, AlgorithmOptions opts, LocationIndex idx, String expectedAlgo)

Uses of Graph in com.graphhopper.storage

Subinterfaces of Graph in com.graphhopper.storage

Modifier and Type	Interface and Description
interface	CHGraph Extended graph interface which supports Contraction Hierarchies.

Classes in com.graphhopper.storage that implement Graph

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.

Methods in com.graphhopper.storage with type parameters of type Graph

Modifier and Type	Method and Description
<T extends Graph> T	GraphHopperStorage.getGraph(Class<T> clazz)
<T extends Graph> T	GraphHopperStorage.getGraph(Class<T> clazz, Weighting weighting) This method returns the routing graph for the specified weighting, could be potentially filled with shortcuts.

Methods in com.graphhopper.storage that return Graph

Modifier and Type	Method and Description
Graph	GraphHopperStorage.copyTo(Graph g)
Graph	Graph.copyTo(Graph g) Copy this Graph into the specified Graph g.
Graph	CHGraphImpl.copyTo(Graph g)
Graph	GraphHopperStorage.getBaseGraph()
Graph	Graph.getBaseGraph()
Graph	CHGraphImpl.getBaseGraph()

Methods in com.graphhopper.storage with parameters of type Graph

Modifier and Type	Method and Description
Graph	GraphHopperStorage.copyTo(Graph g)
Graph	Graph.copyTo(Graph g) Copy this Graph into the specified Graph g.
Graph	CHGraphImpl.copyTo(Graph g)
void	TurnCostExtension.init(Graph graph, Directory dir)
void	GraphExtension.init(Graph graph, Directory dir) initializes the extended storage by giving the base graph
void	GraphExtension.NoOpExtension.init(Graph graph, Directory dir)

Constructors in com.graphhopper.storage with parameters of type Graph

Constructor and Description
BlockArea(Graph g)
GraphEdgeIdFinder(Graph graph, LocationIndex locationIndex)

Uses of Graph in com.graphhopper.storage.change

Constructors in com.graphhopper.storage.change with parameters of type Graph

Constructor and Description
ChangeGraphHelper(Graph graph, LocationIndex locationIndex)

Uses of Graph in com.graphhopper.storage.index

Fields in com.graphhopper.storage.index declared as Graph

Modifier and Type	Field and Description
protected Graph	LocationIndexTree.graph

Constructors in com.graphhopper.storage.index with parameters of type Graph

Constructor and Description
Location2IDFullIndex(Graph g)
Location2IDFullWithEdgesIndex(Graph g)
LocationIndexTree(Graph g, Directory dir)

Uses of Graph in com.graphhopper.util

Methods in com.graphhopper.util that return Graph

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.

Methods in com.graphhopper.util with parameters of type Graph

Modifier and Type	Method and Description
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 exception if uncatched problems like index out of bounds etc
static void	GHUtility.printEdgeInfo(Graph g, FlagEncoder encoder)
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.