System and method for efficient routing on a network in the presence of multiple-edge restrictions and other constraints

摘要: Embodiments provide systems and methods that find the quickest route between two locations on a graph with multi-edge constraints in time space efficient manner. In some embodiments, Dijkstra's algorithm is split into separate universes when a) multiple-edge constraint reached, b) along each edge of constraint. performed for purpose finding (i.e. lowest weighted) to intersect ion(s) at end constraints. These universes, are merged or discarded intersection found. Using these methods, shortest path constrained road network can be efficiently determined.