Please note that this is the chinese postman problem (visit every edge), which is different to the VRP - the vehicle routing problem (visit many nodes).
And VRP needs a routing engine to decide about the shortest distances between the nodes (usually with a distance matrix).
See also one of our other projects https://github.com/graphhopper/jsprit
Please note that this is the chinese postman problem (visit every edge), which is different to the VRP - the vehicle routing problem (visit many nodes).
And VRP needs a routing engine to decide about the shortest distances between the nodes (usually with a distance matrix).