generate boost::program_options object for the routing part

This is derived from the following formular: x = b * (1 + lon/180) => dx = b * dlon/180 y = b * (1 - lat/180) => dy = b * dlat/180 dx^2 + dy^2 < min_p

Returns a vector that is indexed by node ID marking the level at which it is a border node

Identify which of the source candidates segments is being used for paths to the forward and reverse segment targets.

Find the final target with the shortest route and backtrack through the legs to find the paths that create this route.

Requires the heaps for be empty If heaps should be adjusted to be initialized outside of this function, the addition of force_step parameters might be

Returns the straightest intersecting edge turn for the specified step

CH Version of finding all turn penalties. Here is where the actual work is happening

Returns true if the specified step has only one intersection

* Highlight tokens in endpoint URLs, optionally linking to documentation * or adding detail. This is the equivalent of postHighlight but it * operat

Link roads, as far as we are concerned, are short unnamed segments between to named segments.

Silent Turn Instructions are not to be mentioned to the outside world but

traffic lights are very specifically modelled. Sometimes we need to skip them. All checks need to fulfill:

Add the folder contain the script to the lua load path, so script can easily require() other lua scripts inside that folder, or subfolders. See http:/

Generates via candidate nodes from the overlap of the two search spaces from s and t. Returns via node candidates in no particular order; they're not

check a connected road for equality of a name returns 'true' if no equality because this is used as a filter elsewhere, i.e. filter if fn returns 'tru