Shortest path determination processes for use in modeling systems and communications networks
First Claim
1. A method of operating a modeling system, with the aid of a digital computer, to transform a first set of signals, including (a) signals representing a given linear network defined in terms of a set of node identifications signals, (b) a set of weighted/directed edge signals each of which identify the weight, direction and the pair of nodes in said network interconnected via a given edge, and (c) signals representing arbitrarily specified start and target nodes in said network, into a second set of signals indicating the shortest path in said network between said start and target nodes, comprising the steps of:
- (a) providing said computer with a database that includes at least said first set of signals, wherein said database is accessible by said computer to retrieve data during the transformation process; and
(b) transforming with the aid of said computer said first set of signals into said second set of signals by incrementally creating an array of node identification signals through repeated direct reference to said first set of signals, all values of said first set of signals remaining constant during said incremental creation of said second set of signals.
2 Assignments
0 Petitions
Accused Products
Abstract
Methods for operating a modeling system and/or a communications network, using a computer assisted process, are described, which transform a first set of signals, including (a) signals representing a given linear network defined in terms of a set of node identification signals, (b) a set of weighted/directed edge signals each of which identify the weight, direction and the pair of nodes in the network interconnected via a given edge, and (c) signals representing arbitrarily specified start and target nodes in the network, into a second set of signals indicating the shortest path in the network between the start and target nodes. The processes contemplated by the invention perform the aforementioned transformation by incrementally creating an array of node identification signals directly from the first set of signals. No starting matrix (or sparse matrix), as required by prior art processes, needs to be created or stored. Furthermore, the processes contemplated by the invention build the array as a function of array contents (as the array is being incrementally created). As a result of these features, it is not necessary to visit every node in the network to determine the shortest path between two nodes, and the shortest path determination can be made in a manner which conserves computing resources.
71 Citations
34 Claims
-
1. A method of operating a modeling system, with the aid of a digital computer, to transform a first set of signals, including (a) signals representing a given linear network defined in terms of a set of node identifications signals, (b) a set of weighted/directed edge signals each of which identify the weight, direction and the pair of nodes in said network interconnected via a given edge, and (c) signals representing arbitrarily specified start and target nodes in said network, into a second set of signals indicating the shortest path in said network between said start and target nodes, comprising the steps of:
-
(a) providing said computer with a database that includes at least said first set of signals, wherein said database is accessible by said computer to retrieve data during the transformation process; and (b) transforming with the aid of said computer said first set of signals into said second set of signals by incrementally creating an array of node identification signals through repeated direct reference to said first set of signals, all values of said first set of signals remaining constant during said incremental creation of said second set of signals. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A method of operating a computer assisted communications network to transform a first set of signals, including (a) signals representing a given linear communications network defined in terms of a set of node identification signals, (b) a set of weighted/directed edge signals each of which identify the weight, direction and the pair of nodes in said network interconnected via a given edge, and (c) signals representing arbitrarily specified start and target nodes in said network, into a second set of signals indicating the shortest path in said network between said start and target nodes, comprising the steps of:
-
(a) providing said computer with a database that includes at least said first set of signals, wherein said database is accessible by said computer to retrieve data during the transformation process; and (b) transforming with the aid of said computer said first set of signals into said second set of signals by incrementally creating an array of node identification signals through repeated direct reference to said first set of signals, all values of said first set of signals remaining constant during said incremental creation of said second set of signals. - View Dependent Claims (20)
-
-
21. A computer assisted process for transforming a first set of signals, including (a) signals representing a given linear communications network defined in terms of a set of node identification signals, (b) a set of weighted/directed edge signals each of which identify the weight, direction and the pair of nodes in said network interconnected via a given edge, and (c) signals representing arbitrarily specified start and target nodes in said network, into a second set of signals indicating the shortest path in said network between said start and target nodes, comprising the steps of:
-
(a) providing said computer with a database that includes at least said first set of signals, wherein said database is accessible by said computer to retrieve data during the transformation process; and (b) transforming with the aid of said computer said first set of signals into said second set of signals by incrementally creating an array of node identification signals through repeated direct reference to said first set of signals, all values of said first set of signals remaining constant during said incremental creation of said second set of signals. - View Dependent Claims (22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34)
-
Specification