Install Jentic One Beta
Jentic One is a self-hosted execution layer for AI agents. It lets your agent call the GraphHopper Directions API, or any other public or private API you need. You set the rules, the agent never sees your credentials, and every call is logged.
Two steps, two machines. Install the instance in a safe environment, then register your agent from wherever it runs.
Step 1: Jentic One Host machine
# On the machine that will host your Jentic One instance:
curl -fsSL "https://jentic.com/install.sh?src=apis&api=%2Fapis%2Fgraphhopper.com%2Fgraphhopper" | shStep 2: Agent machine
# On the machine where your agent runs (keep this separate from the instance):
curl -fsSL "https://jentic.com/install.sh?src=apis&api=%2Fapis%2Fgraphhopper.com%2Fgraphhopper" | sh
jentic register # connects your agent to your Jentic One instanceJentic One is in public beta. The setup above keeps your agent separate from the instance, which is what you want before using real credentials: an agent running as the same OS user as Jentic One can read its stored keys directly. Just evaluating? A single local install is fine to start. See the secure deployment guide for the tiers.
What an agent can do with GraphHopper Directions API.
Calculate a route between waypoints with turn-by-turn instructions
Compute travel-time and distance matrices across many points
Generate isochrones showing reachable area within a time or distance
Geocode place names to coordinates and reverse geocode
Match a recorded GPS trace to the road network
GET STARTED
Solve vehicle routing problems that sequence stops across a fleet
Poll a submitted vehicle routing job for its solution
Patterns agents use GraphHopper Directions API for, with concrete tasks.
★ AI Agent for Trip Planning
A travel or logistics agent plans a trip and reports distance and time. Through Jentic it geocodes the start and end, calls the route endpoint for the path and turn-by-turn steps, and can generate an isochrone to show what is reachable nearby. The agent discovers the routing and geocoding operations by intent, so it answers with real directions without a developer wiring the HTTP calls.
Geocode two place names, request the driving route between them, and return the distance, duration, and turn-by-turn steps
Fleet and Delivery Optimization
A dispatch system assigns and sequences stops across vehicles. It submits a vehicle routing problem with the stops and vehicle constraints, then polls the job until GraphHopper returns an optimized plan. The result minimizes total drive time so the fleet covers its stops efficiently.
Submit the day's stops and available vehicles to the VRP solver, poll the job for the solution, and return each vehicle's ordered route
Reachability and Service-Area Analysis
A site-selection or coverage tool needs to know what is reachable from a location. It calls the isochrone endpoint to draw the area reachable within a time budget and uses the matrix endpoint to compare travel times to many candidate points. This supports decisions like where to place a store or which depot serves an address fastest.
Generate a 15-minute isochrone around a candidate site and compute a travel-time matrix from it to nearby demand points
9 endpoints — the graphhopper directions api is a routing toolkit for moving people and goods.
METHOD
PATH
DESCRIPTION
/route
Calculate a route between waypoints
/route
Calculate a route from a request body
/isochrone
Generate a reachable-area isochrone
/matrix
Compute a travel-time and distance matrix
/geocode
Geocode place names to coordinates
/vrp
Submit a vehicle routing problem to solve
/match
Match a GPS trace to the road network
/route
Calculate a route between waypoints
/route
Calculate a route from a request body
/isochrone
Generate a reachable-area isochrone
/matrix
Compute a travel-time and distance matrix
/geocode
Geocode place names to coordinates
/vrp
Submit a vehicle routing problem to solve
/match
Match a GPS trace to the road network
What agents get from Jentic-routed access to this vendor.
Setup
Using the GraphHopper Directions API by hand means adding the key query parameter to every call, choosing between GET and POST forms for large requests, and polling the asynchronous vehicle routing job yourself. Through Jentic you install once, import the API from the Directory, and your agent calls the right operation.
Permission scoping
Most GraphHopper operations are read-only, so you allow only the ones a task needs, such as GET /route and GET /matrix, and keep the vehicle routing solver out of the allowed set if the agent should not submit jobs. Rules run on your own instance and every call the agent makes is logged.
Credential isolation
Your GraphHopper API key is stored once, encrypted, by your own Jentic One instance and added to each request at execution time, so it never enters the agent's prompt, logs, or context.
Intent-based discovery
Agents search Jentic by intent such as 'calculate a route' or 'build a travel-time matrix', and Jentic returns the matching GraphHopper operation with its input schema so the agent calls the right endpoint without reading reference docs.
Alternatives and complements available in the Jentic catalogue.
Specific to using GraphHopper Directions API through Jentic.
What authentication does the GraphHopper Directions API use?
Per its OpenAPI spec it uses an API key passed as the key query parameter. Through Jentic that key is stored encrypted on your own instance and added to each request at call time, so it never appears in the agent's prompt or logs.
How do I calculate a route with the GraphHopper Directions API?
Call GET /route with your waypoints and a vehicle profile, or POST /route to send a larger request body. The response includes the path, distance, duration, and turn-by-turn instructions. Through Jentic you search for the intent 'calculate a route' and the agent gets the operation and its input schema.
Is the GraphHopper vehicle routing solver synchronous?
No. POST /vrp submits a vehicle routing problem as a job and returns a job id, then you poll GET /vrp/solution/{jobId} until the optimized plan is ready. This lets the solver work on large fleets and many stops without blocking the request.
Can the GraphHopper Directions API build a travel-time matrix?
Yes. GET /matrix returns travel times and distances between many origins and destinations in one call, and POST /matrix accepts a larger request body. This is the efficient way to compare many point-to-point costs without a route call for each pair.
What are the rate limits for the GraphHopper Directions API?
The OpenAPI spec does not define numeric rate limits; they depend on your GraphHopper plan and its credit allowance. Cache stable results like geocodes and check https://graphhopper.com for current plan limits.
Can I limit what my agent is allowed to do with the GraphHopper Directions API?
Yes. Most operations are read-only, so you allow only the ones a task needs, such as GET /route and GET /geocode, and leave the vehicle routing solver out of the allowed set if the agent should not submit jobs. Through Jentic these rules run on your own instance and every call is logged.
Is there a GraphHopper MCP server?
You don't need a separate MCP server to give your agent the GraphHopper Directions API. Jentic connects it directly from the API Directory: import the API and your agent calculates routes and matrices on demand without loading another server's tool definitions into its context.
For Agents
Calculate routes, travel-time and distance matrices, and isochrones with GraphHopper; geocode places, map-match GPS traces, and solve vehicle routing problems.
Use for: Get driving directions between these two points, Build a travel-time matrix between these locations, Show the area reachable within 20 minutes from here, Geocode this address to coordinates
Not supported: Covers routing, matrix, isochrone, geocoding, map matching, and vehicle routing. It does not render interactive map tiles or provide live traffic incident feeds.
The GraphHopper Directions API is a routing toolkit for moving people and goods. Calculate a route between waypoints for cars, bikes, or on foot with turn-by-turn instructions, compute travel-time and distance matrices between many origins and destinations, and generate isochrones that show how far you can travel in a given time. It also geocodes place names to coordinates and back, matches noisy GPS traces to the road network, and solves vehicle routing problems that assign and sequence stops across a fleet. The vehicle routing solver runs as an asynchronous job you submit and then poll for the solution.