Given a start and destination postcode, return the distance between them. If the road algorithm is selected this distance will be over the road (meters) and includes car drive time (minutes).

The given postcodes should either be both fourpps or sixpps.

You can use the more precise sixpp postcode format only for postcodes within a 5000 meter distance. If we'd keep a bigger lookup table, the storage requirements would be too high. Revert to a fourpp postcode format for the bigger distances. That shouldn't be a problem as precision should matter less when postcodes are apart much further.


A sixpp or a fourpp to start calculating from.


fromPostalCode

toPostalCode

Specifies the algorithm for calculating distance and time.

Available Algorithms:
* `straight`: Calculates the distance in a straight line.
* `road`: Calculates the actual traveling distance and time using the drive time matrix (shortest route) over the actual road network.
    * Availability of `road` depends on your subscription level.
    * For trial purposes, this algorithm can be used with any subscription level for the following postcode ranges:
        * `1000-1098`, `1100-1108` (Amsterdam)
        * `3000-3089` (Rotterdam)
        * `5600-5658` (Eindhoven)


algorithm

Given a start and destination postcode, return the distance between them. If the road algorithm is selected this distance will be over the road (meters) and includes car drive time (minutes).

The given postcodes should be 4 digits long.


Specifies the algorithm for calculating distance and time.

Available Algorithms:
* `straight`: Calculates the distance in a straight line.
* `road`: Calculates the actual traveling distance and time using the drive time matrix (shortest route) over the actual road network.
    * Availability of `road` depends on your subscription level.
    * For trial purposes, this algorithm can be used with any subscription level for the following postcodes: `4146` (Hochwald), `4147` (Aesch) and `4148` (Pfeffingen).
