Tags : Browse Projects

The Open Source Routing Machine (OSRM) is a C++ implementation of a high-performance routing engine for shortest paths in road networks. It combines sophisticated routing algorithms with the open and free road network data of the OpenStreetMap (OSM) project. Shortest path computation on a ... [More] continental sized network can take up to several seconds if it is done without a so-called speedup-technique. OSRM is able to compute and output a shortest path between any origin and destination within a few miliseconds. Since it is designed with OpenStreetMap compatibility in mind, OSM data files can be easily imported. [Less]

Adapters for Java implementations of algorithms for routing the shortest paths between two vertices/nodes/points in a directed weighted graph without multiple edges between the same two vertices. The resulting paths must not have any loops/cycles i.e. must not visit the same vertex more than once ... [More] within the same path. The resulting paths do not have to be disjoint. Neither edge-disjoint nor vertex-disjoint. In other words it is okay that the same edge or vertex exist in different paths. The license for the core project is MIT but the adapee/adapter libraries licensed in the same way as the corresponding original Java code i.e. Apache 2.0 license. [Less]

Adapters for C#.NET implementations of algorithms for routing the shortest paths between two vertices/nodes/points in a directed weighted graph without multiple edges between the same two vertices. The resulting paths must not have any loops/cycles i.e. must not visit the same vertex more than ... [More] once within the same path. The resulting paths do not have to be disjoint. Neither edge-disjoint nor vertex-disjoint. In other words it is okay that the same edge or vertex exist in different paths. The license for the core project is MIT but the adapee/adapter libraries licensed in the same way as the corresponding original Java code i.e. Apache 2.0 license. [Less]