1. A method of programmatically calculating paths, comprising steps of: identify an origin and a destination; determining a first street on which the origin is located and a second street on which the destination is located; and computing a path from the origin on the first street to the destination on the second street using intersection data by iteratively performing, until completing the path, steps of: computing a hounding box between the origin and the destination; computing a shortest linear path (“SLP”) between the origin and the destination; and selecting, from the intersection data when the path is not yet complete, an intersection point closest to the SLP to replace the origin for subsequent iterations of the iteratively performed steps, wherein the path is complete when the street on which the origin is located intersects the street on which the destination is located.