OpenStreetMap-data and own graph-files are parsed and routing-algorithms compute shortest paths. Further, a graph (or the underlying network) can be optimized by computing a new metric, that reduces the workload of rush-hour-scenarios.
OpenStreetMap-data and own graph-files are parsed and routing-algorithms compute shortest paths. Further, a graph (or the underlying network) can be optimized by computing a new metric, that reduces the workload of rush-hour-scenarios.
Other