Open-Harbor/osrm-backend
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 3 Wiki Activity

Updated README (Thanks again Bharath!)

Browse Source
This commit is contained in:
Dennis Luxen 2011-05-24 13:53:13 +00:00
parent fba77ff459
commit 9ad7d9db8f
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
README.TXT
View File

@ -35,13 +35,13 @@ preprocessing runs in three steps, all done by seperate programs.
necessary, because the osm data is not made to support fast routing out of the
box. The output of the step is a file called 'file.osrm'
'createHierarchy file.osmr' preprocesses the road network and computes additional
'createHierarchy file.osrm' preprocesses the road network and computes additional
information that is exploited later to speed up the path computation. The output
of this step consists of two file 'file.osrm.hsgr' and 'file.osrm.nodes'. The first
file is the so-called hierarchy that speeds up the path computation while the
latter one carries (among other things) geographical information.
'routed file.osmr.hsgr file.osm.hsgr' starts the server on TCP Port 5000. The
'routed' starts the server on TCP Port 5000. The
server communicates over http and can be queried by any browser or http-capable
command line tool. The server responds with KML-formatted output.Assume the
server is installed on machine localhost and a map containing the Netherlands
@ -50,4 +50,4 @@ calling
http://localhost:5000/route&52.370197&4.890444&52.048167&4.3175
which gives a shortest (fastest) route between the two points. To locate a
point in the map that is nearest to a given coordinate use the following call
http://localhost:5000/locate&52.048167&4.3175
http://localhost:5000/nearest&52.048167&4.3175