Software Diagram Editor
| org.heigit.ors.routing.graphhopper.extensions.core | Edit this Diagram
no source
class IntArrayDeque
no source
class IntArrayList
no source
class IntHashSet
no source
class IntObjectMap
no source
class GHBitSet
no source
class GHIntObjectHashMap
no source
class GHTreeMapComposed
no source
class AbstractRoutingAlgorithm
no source
class DijkstraOneToMany
no source
class RoutingAlgorithmFactory
no source
class RoutingAlgorithmFactoryDecorator
no source
class PreparationWeighting
no source
class LandmarkSuggestion
no source
class SubnetworkStorage
no source
class AbstractAlgoPreparation
Interfaceno source
interface EdgeFilter
no source
class FlagEncoder
no source
class TraversalMode
no source
class SpatialRuleLookup
no source
class ConsistentWeightApproximator
no source
class WeightApproximator
no source
class Weighting
no source
class CHGraph
no source
class CHGraphImpl
no source
class CHProfile
no source
class DataAccess
no source
class Directory
no source
class Graph
no source
class GraphHopperStorage
no source
class SPTEntry
no source
class Storable
no source
class CHEdgeExplorer
no source
class EdgeExplorer
no source
class StopWatch
no source
class Logger
Abstract
abstract class AbstractCoreRoutingAlgorithm
Calculates best path using cor e routing algorithm. A core a lgorithm is separated int...
class CoreALT
Calculates best path using CH routing outside core and ALT inside core. This code is...
class CoreAlgoFactoryDecorator
This class implements the Core Algo decorator and provides several helper methods re...
class CoreDijkstra
Calculates best path using cor e routing algorithm. This cod e is based on that from G...
class CoreDijkstraFilter
Only certain nodes are accepte d and therefor the others are ignored. This code is ba...
class CoreLMAlgoFactoryDecorator
This class implements the A*, landmark and triangulation (A LT) decorator for Core. T...
class CoreLMApproximator
This class is a weight approxi mation based on precalculated landmarks for core. This...
class CoreLMOptions
class CoreLandmarkStorage
Store Landmark distances for c ore nodes This code is based on that from GraphHopper ...
class CoreNodeContractor
This code is based on that fro m GraphHopper GmbH.
no source
class PathBidirRef
class PrepareCore
Prepare the core graph. The co re graph is a contraction hie rarchies graph in which s...
class PrepareCoreLandmarks
This class does the preprocess ing for the ALT algorithm (A* , landmark, triangle ine...
class ProxyNodeDijkstra
Finds proxy nodes in the graph . A proxy node of a given nod e is the closest node to ...
class TarjansCoreSCCAlgorithm
Implementation of Tarjan's alg orithm using an explicit stac k. The traditional recurs...
class LMEdgeFilterSequence
additionalCoreEdgeFilterbestPathchGraphbestWeightMapFromignoreExplorationFromweightApproxchProfiles 0..* preparations 0..* bestWeightMapFromcurrFromgraphrestrictionscoreLMOptionspreparations 0..* weightings 0..* fallBackApproximationgraphlmsvirtNodeMapfilters 0..* coreencodergraphlandmarkSuggestions 0..* landmarkWeightDAlandmarksFilterlmSelectionWeightingruleLookupsubnetworkStoragetraversalModechProfiledijkstraSWghStorageoriginalEdgesprepareAlgoprepareGraphprepareWeightingrestrictionFiltervehicleInExplorerLOGGERallSWcalcPrioAllExplorerchProfiledirghStoragenodeContractorprepareGraphprepareWeightingrestrictionFiltersortedNodestraversalModeweightinggraphlandmarksFilterlmsweightingchGraphcurrEdgeexplorerfromMapcomponents 0..* coreedgeFiltergraphignoreSetnodeStack