1
0
Fork 0
mirror of https://github.com/graphhopper/jsprit.git synced 2020-01-24 07:45:05 +01:00

Update README.md

This commit is contained in:
jsprit 2013-08-08 08:03:43 +02:00
parent 9df4284040
commit d78297a214

View file

@ -13,7 +13,7 @@ Modifying the algorithms and visualising the discovered solutions is as easy and
reading classical VRP instances to benchmark your algorithm.
Additionally, jsprit can be used along with <a href="http://www.matsim.org" target="blank_">MATSim</a>
to solve the above problem-types in real networks (without preprocessing transport times and costs). A variety of least cost path algorithms such as Dijkstra and A*
to solve the above problem-types in real networks (i.e. without preprocessing transport times and costs). A variety of least cost path algorithms such as Dijkstra and A*
can be used, and a dynamic and interactive visualiser greatly enhances the analysis.
##In Development