Uses of Interface
com.graphhopper.storage.Graph

Packages that use Graph

Package	Description
com.graphhopper.isochrone.algorithm
com.graphhopper.routing
com.graphhopper.routing.ch
com.graphhopper.routing.lm
com.graphhopper.routing.querygraph
com.graphhopper.routing.subnetwork
com.graphhopper.routing.util
com.graphhopper.storage
com.graphhopper.storage.index
com.graphhopper.util
com.graphhopper.util.details

Uses of Graph in com.graphhopper.isochrone.algorithm

Constructors in com.graphhopper.isochrone.algorithm with parameters of type Graph

Constructor and Description
ShortestPathTree(Graph g, Weighting weighting, boolean reverseFlow, TraversalMode traversalMode)

Uses of Graph in com.graphhopper.routing

Fields in com.graphhopper.routing declared as Graph

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

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

Modifier and Type	Method and Description
static InstructionList	InstructionsFromEdges.calcInstructions(Path path, Graph graph, Weighting weighting, EncodedValueLookup evLookup, Translation tr)
RoutingAlgorithm	RoutingAlgorithmFactorySimple.createAlgo(Graph g, Weighting w, AlgorithmOptions opts)
RoutingAlgorithm	RoutingAlgorithmFactory.createAlgo(Graph g, Weighting w, AlgorithmOptions opts) This method creates an algorithm out of this factory based on the specified opts and graph.
protected DefaultBidirPathExtractor	AbstractNonCHBidirAlgo.createPathExtractor(Graph graph, Weighting weighting)
static Path	PathExtractor.extractPath(Graph graph, Weighting weighting, SPTEntry sptEntry)
static Path	DefaultBidirPathExtractor.extractPath(Graph graph, Weighting weighting, SPTEntry fwdEntry, SPTEntry bwdEntry, double weight)

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

Constructor and Description
AbstractNonCHBidirAlgo(Graph graph, Weighting weighting, TraversalMode tMode)
AbstractRoutingAlgorithm(Graph graph, Weighting weighting, TraversalMode traversalMode)
AlternativeRoute(Graph graph, Weighting weighting, TraversalMode traversalMode, PMap hints)
AStar(Graph graph, Weighting weighting, TraversalMode tMode)
AStarBidirection(Graph graph, Weighting weighting, TraversalMode tMode)
DefaultBidirPathExtractor(Graph graph, Weighting weighting)
Dijkstra(Graph graph, Weighting weighting, TraversalMode tMode)
DijkstraBidirectionRef(Graph graph, Weighting weighting, TraversalMode tMode)
DijkstraOneToMany(Graph graph, Weighting weighting, TraversalMode tMode)
DirectionResolver(Graph graph, DirectedEdgeFilter isAccessible)
HeadingResolver(Graph graph)
InstructionsFromEdges(Graph graph, Weighting weighting, EncodedValueLookup evLookup, InstructionList ways)
Path(Graph graph)
PathExtractor(Graph graph, Weighting weighting)

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
static void	CHPreparationGraph.buildFromGraph(CHPreparationGraph prepareGraph, Graph graph, Weighting weighting)
static CHPreparationGraph.TurnCostFunction	CHPreparationGraph.buildTurnCostFunctionFromTurnCostStorage(Graph graph, Weighting weighting) Builds a turn cost function for a given graph('s turn cost storage) and given uTurnCosts.

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	LMRoutingAlgorithmFactory.createAlgo(Graph g, Weighting w, AlgorithmOptions opts)
static LMApproximator	LMApproximator.forLandmarks(Graph g, LandmarkStorage lms, int activeLM)

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

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)

Uses of Graph in com.graphhopper.routing.querygraph

Classes in com.graphhopper.routing.querygraph 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.

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

Modifier and Type	Method and Description
Graph	QueryRoutingCHGraph.getBaseGraph()

Uses of Graph in com.graphhopper.routing.subnetwork

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

Modifier and Type	Method and Description
static EdgeBasedTarjanSCC.ConnectedComponents	EdgeBasedTarjanSCC.findComponents(Graph graph, EdgeBasedTarjanSCC.EdgeTransitionFilter edgeTransitionFilter, boolean excludeSingleEdgeComponents) Runs Tarjan's algorithm using an explicit stack.
static TarjanSCC.ConnectedComponents	TarjanSCC.findComponents(Graph graph, EdgeFilter edgeFilter, boolean excludeSingleNodeComponents) Runs Tarjan's algorithm using an explicit stack.
static EdgeBasedTarjanSCC.ConnectedComponents	EdgeBasedTarjanSCC.findComponentsForStartEdges(Graph graph, EdgeBasedTarjanSCC.EdgeTransitionFilter edgeTransitionFilter, com.carrotsearch.hppc.IntContainer edges) Like EdgeBasedTarjanSCC.findComponents(Graph, EdgeTransitionFilter, boolean), but the search only starts at the given edges.
static EdgeBasedTarjanSCC.ConnectedComponents	EdgeBasedTarjanSCC.findComponentsRecursive(Graph graph, EdgeBasedTarjanSCC.EdgeTransitionFilter edgeTransitionFilter, boolean excludeSingleEdgeComponents) Runs Tarjan's algorithm in a recursive way.
static TarjanSCC.ConnectedComponents	TarjanSCC.findComponentsRecursive(Graph graph, EdgeFilter edgeFilter, boolean excludeSingleNodeComponents) Runs Tarjan's algorithm in a recursive way.

Uses of Graph in com.graphhopper.routing.util

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

Modifier and Type	Method and Description
static void	RoadDensityCalculator.calcRoadDensities(Graph graph, BiConsumer<RoadDensityCalculator,EdgeIteratorState> edgeHandler, int threads) Loops over all edges of the graph and calls the given edgeHandler for each edge.
static void	UrbanDensityCalculator.calcUrbanDensity(Graph graph, EnumEncodedValue<UrbanDensity> urbanDensityEnc, EnumEncodedValue<RoadClass> roadClassEnc, BooleanEncodedValue roadClassLinkEnc, double residentialAreaRadius, double residentialAreaSensitivity, double cityAreaRadius, double cityAreaSensitivity, int threads) Calculates the urban density (rural/residential/city) for all edges of the graph.

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

Constructor and Description
RoadDensityCalculator(Graph graph)

Uses of Graph in com.graphhopper.storage

Classes in com.graphhopper.storage that implement Graph

Modifier and Type	Class and Description
class	BaseGraph The base graph handles nodes and edges file format.

Methods in com.graphhopper.storage that return Graph

Modifier and Type	Method and Description
Graph	RoutingCHGraphImpl.getBaseGraph()
Graph	RoutingCHGraph.getBaseGraph()

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

Modifier and Type	Method and Description
static GraphEdgeIdFinder.BlockArea	GraphEdgeIdFinder.createBlockArea(Graph graph, LocationIndex locationIndex, List<GHPoint> points, PMap hints, EdgeFilter edgeFilter)

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.index

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

Constructor and Description
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.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 void	GHUtility.addRandomTurnCosts(Graph graph, long seed, BooleanEncodedValue accessEnc, DecimalEncodedValue turnCostEnc, int maxTurnCost, TurnCostStorage turnCostStorage)
static void	GHUtility.buildRandomGraph(Graph graph, Random random, int numNodes, double meanDegree, boolean allowLoops, boolean allowZeroDistance, BooleanEncodedValue accessEnc, DecimalEncodedValue speedEnc, Double speed, double pNonZeroLoop, double pBothDir, double pRandomDistanceOffset)
static int	GHUtility.getAdjNode(Graph g, int edge, int adjNode)
static EdgeIteratorState	GHUtility.getEdge(Graph graph, int base, int adj)
static List<String>	GHUtility.getProblems(Graph g) This method could throw an exception if problems like index out of bounds etc
static void	GHUtility.printGraphForUnitTest(Graph g, BooleanEncodedValue accessEnc, DecimalEncodedValue speedEnc)
static void	GHUtility.printGraphForUnitTest(Graph g, BooleanEncodedValue accessEnc, DecimalEncodedValue speedEnc, BBox bBox)
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)

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

Constructor and Description
PathMerger(Graph graph, Weighting weighting)

Uses of Graph in com.graphhopper.util.details

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

Modifier and Type	Method and Description
static Map<String,List<PathDetail>>	PathDetailsFromEdges.calcDetails(Path path, EncodedValueLookup evLookup, Weighting weighting, List<String> requestedPathDetails, PathDetailsBuilderFactory pathBuilderFactory, int previousIndex, Graph graph) Calculates the PathDetails for a Path.
List<PathDetailsBuilder>	PathDetailsBuilderFactory.createPathDetailsBuilders(List<String> requestedPathDetails, EncodedValueLookup evl, Weighting weighting, Graph graph)

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

Constructor and Description
IntersectionDetails(Graph graph, Weighting weighting)