Method trip

src/nodejs/node_osrm.cpp:591–598

clang-format off * The trip plugin solves the Traveling Salesman Problem using a greedy heuristic * (farthest-insertion algorithm) for 10 or * more waypoints and uses brute force for less than 10 * waypoints. The returned path does not have to be the shortest path, * as TSP is NP-hard it is * only an approximation. * * Note that all input coordinates have to be connected for the trip service

 */
// clang-format on
Napi::Value Engine::trip(const Napi::CallbackInfo &info)
{
    osrm::Status (osrm::OSRM::*trip_fn)(const osrm::TripParameters &params,
                                        osrm::engine::api::ResultT &result) const =
        &osrm::OSRM::Trip;
    async(info, &argumentsToTripParameter, trip_fn, true);
    return info.Env().Undefined();
}

/**
 * All plugins support a second additional object that is available to configure some NodeJS