Patent ID: 8289853

Claim:
A computer implemented method of finding the shortest path between a source vertex and multiple destination vertices, said method comprising: evaluating with a computer a length of an edge from a tail vertex to each of one or more head vertices, wherein the tail vertex is a vertex from which the edge emanates and a head vertex is a vertex to which the edge extends; setting with the computer for each of the one or more head vertices a head vertex length as the length of the edge from the tail vertex to the head vertex combined with a tail vertex length, wherein the tail vertex length is a length of all edges from the tail vertex to a source vertex; placing each of the one or more head vertices in memory locations using the computer, the memory locations corresponding to the head vertex length, wherein the memory locations comprises a first set of memory locations corresponding to a first range of head vertex lengths and a second set of memory locations corresponding to a second range of head vertex lengths; and repeating the evaluating, setting, and placing acts for multiple next tail vertices, wherein each next tail vertex is determined by a shortest head vertex length from the first set of memory locations using the computer.