UNKNOWN,LEFT,RIGHT,STRAIGHT_AHEAD

NORTH,NORTH_EAST,EAST,SOUTH_EAST,SOUTH,SOUTH_WEST, WEST,NORTH_WEST

METERS,KILOMETERS,MILES,UNKNOWN

DISTANCE,TIME

The class handles the error reporting whenever an invalid service/export combination...

Superclass for eccentricity calculations. Stores and orders references to eccentrici...

Calculates an isochrone using a partitioned and graph. The algorithm works in 3 phas...

calculates maximum range (eccentricity) within a cell.

Calculates shortest paths within an active isochrones cell. Starts from a given set ...

Allows all edges within a given cell AND all edges to bordernodes

Calculates Outlines (Contour) of cells. Contours are concave hulls of a given set of...

Single-source shortest path algorithm bound by isochrone limit.

Eccentricity implementation. Calculates the maximum value of all shortest paths with...

Implementation of Fast Isochrones

EdgeFilter to stay within cell.

calculates maximum range (eccentricity) within a cell.

Helper class for keeping track of a node partitioning based on IntHashSets.

Helper class for keeping track of a node partitioning projections based on IntHashSe...

Lightweight entry object for ordering nodes in a queue/deque based on weight.

EdmondsKarp implementation of the maxflow algorithm using a deque. Finds the maximum...

Factory for Fast Isochrone Preparation This code is based on that from GraphHopper G...

Parameters for fast isochrone algorithm preprocessing and query processing. Some def...

Data element for partitioning.

Recursive implementation of InertialFlow algorithm for partitioning a graph.

Based on https://stackoverflow.com/questions/ 4958330/java-executorservice-awaittermi...

Abstract MaxFlowMinCut implementation.

Temporary preprocessing time storage for max flow min cut data.

Creates the data necessary for running a max flow min cut algorithm.

Prepares the partition of the graph.

Helper class for sorting.

Stores nodes ordered by cell and contours of cells.

Storage that maps nodeIds to their respective cells and borderness.

Object to store a set of nodeids and respective distances.

Stores distances of bordernodes in a cell.

Stores eccentricities of cell border nodes for fast isochrones. Eccentricities are w...

This Class handles the error Codes as described in the error_codes.md

Calculates isochrone polygons using fast isochrone algorithm.

This class handles the population statistic queries. It generates internal api calls...

Provides package-private helper methods for the JTS utility class.

JTS Geometry utility methods, bringing Geotools to JTS. Offers geotools based servic...

GhMapMatcher is a facade implementing the interface of ORS's AbstractMapMatcher usin...

This Class handles the error Codes as described in the error_codes.md

This class is used to store the search/ calculation Parameters to calculate the desir...

A Core and Dijkstra based algorithm that calculates the weights from multiple start ...

A Core and Dijkstra based algorithm that runs a many to many search in the core and ...

UNKNOWN,TEXT,HTML

This class is used to store the search/ calculation Parameters to calculate the desir...

Holder class for a warning that could be used in the response

This Class handles the error Codes as described in the error_codes.md

This class generates RoutingProfile classes and is used by mostly all service classe...

Holds resources shared between instances of RoutingProfile . An example of such a sh...

Callable creating a RoutingProfile from an OSM- file,a RouteProfileConfiguration and ...

This class is a preliminary adaptation of ORSWeightingFactory to the new interface o...

Calculates best path using core routing algorithm. A core algorithm is separated int...

Calculates best path using CH routing outside core and ALT inside core. This code is...

Calculates best path using core routing algorithm. This code is based on that from G...

Only certain nodes are accepted and therefor the others are ignored. This code is ba...

This class implements the A*, landmark and triangulation (ALT) decorator for Core. T...

Store Landmark distances for core nodes This code is based on that from GraphHopper ...

Only certain nodes are accepted and therefor the others are ignored. This code is ba...

This class implements the Core Algo decorator and provides several helper methods re...

Given a RoutingCHGraph and possibly a QueryGraph this class sets up and creates rout...

Prepare the core graph. The core graph is a contraction hierarchies graph in which s...

This class does the preprocessing for the ALT algorithm (A* , landmark, triangle ine...

Implementation of Tarjan's algorithm using an explicit stack. The traditional recurs...

This class includes in the core all edges with speed more than the one set in the or...

This class includes in the core all edges which have traffic speed assigned.

This class includes in the core all edges with turn restrictions.

Defines bit layout for cars. (speed, access, ferries, ...)

This code has been adapted from the original GraphHopper FootFlagEncoder found at ht...

Defines bit layout of bicycles (not motorcycles) for speed, access and relations (ne...

Specifies the settings for mountain biking

Specifies the settings for cycletouring/trekking

Specifies the settings for race biking

Object used for storing country boundary polygons in a hiearchical structure.

Shortest Path Tree with multiple fields for containing multiple source information. ...

Graph storage class for the Border Restriction routing

This class is used to create the shortest-path- tree from linked entities.

Created by ZWang on 13/06/2017.

The graph storage for road access restrictions.

Created by ZWang on 13/06/2017.

Simple storage designed to hold edgeID - direction - speed Speeds should be in kph I...

Graph storage class for the Border Restriction routing

Interface for declaring a graph storage as bein able to be used for producing warnin...

Class for building the Borders graph extension that allows restricting routes regard...

Created by lliu on 13/03/2017.

Created by ZWang on 13/06/2017.

Builder for road access restrictions information. The purpose is to record for edges...

This class builds the shadow index data as a new ShadowGraphStorage.

Speed calculator to limit the speed during routing according to the maximum speed se...

This code is based on that from GraphHopper GmbH.

WORST,AVOID_AT_ALL_COSTS,REACH_DEST,AVOID_IF_ POSSIBLE,UNCHANGED,PREFER,VERY_NICE,BEST Used to store a priority value in the way flags of an edge. Used in combination with...

Special weighting for down/uphills

Special weighting for (motor)bike

Created by lliu on 15/03/2017.

Modifies weight of edges marked with access destination or private by multiplying it...

Modified `FastestWeighting` which has the penalty for edges with access destination ...

TURN_LEFT,TURN_RIGHT,TURN_SHARP_LEFT,TURN_SHARP_ RIGHT,TURN_SLIGHT_LEFT,TURN_SLIGHT_RIGHT,CONTINUE. ..

Helper class for reading data from a CSV file. Based on code from https://www.mkyong...

Title: CoordTools Description: Class for some Operations with Coordinates - (Coordi...

This class implements fast, thread-safe format of a double value with a given number...

Simple utilities to return the stack trace of an exception as a String.

Title: StreamUtility Description: Copyright: Copyright (c) 2014 by Maxim Rylov

This is a org.heigit.ors.routing.RouteResult Mockup-Class, used in junit tests and w...

This is a org.heigit.ors.routing.RoutingRequest Mockup-Class, used in junit tests an...

Computes a concave hull of a Geometry which is a concave Geometry that contains all ...

Edge.

Triangle.

Vertex.