System and Method for efficient Routing in a Network of constraints in the presence of multiple edges and other constraints.

摘要

The embodiments provide Systems and Methods for finding the fastest Route between two points on a graph with constraints in multiple edges efficiently in time and Space.In some embodiments the Dijkstra algorithm is divided into separate Universes when: (a) reaches a limitation of multiple edges, (b) along each Edge of a limitation of multiple edges. In some embodiments, the Division is performed to find the quickest Route (i.e., less heavy) the Intersections or at the end of the constraints.These Universes, in some embodiments, merge or discarded when the intersection is located at the end of the constraint. Using these systems and Methods, in some embodiments, The Shortest Path between two points in a road network with constraints of multiple edges may be effic Azmente determined.