| 摘要 |
Method for computing a shortest path tree structure for nodes in an interconnected network comprising the steps of maintaining a data structure T consisting of a set of edges e interconnecting the plurality of nodes in the network, each node having an associated parent node and distance value attributes; determining a weight change DELTA of an edge; obtaining a set of candidate nodes having associated parent and distance attributes that are affected by the weight change; selecting a node of the set of candidate nodes; identifying one or more descendents of the selected node and calculating a new distance attribute for each of the one or more descendents; searching for other nodes connected to the one or more identified descendent nodes and determining whether they should be included in the data structure T; and, repeating the selecting, identifying, calculating, searching and determining steps until all nodes of the set of candidate nodes are selected to update the data structure T.
|
