| 摘要 |
A method is provided of generating a plurality of diverse routes from a source to a destination in a weighted directed graph. Such a method may be used for route planning or navigation with the weighted directed graph representing a road network, but may also be used in other applications. A source routing tree is generated from the source to a first set of points of the graph, which may comprise some or all of the points. A destination routing tree is generated from some or all of the points of the graph to the destination. The trees are then combined to form the routes. For example, the sub-routes common to and transverses in the same direction by the source and destination trees may be selected. The sub routes may then be formed into the routes by extending each sub-route as necessary to the source and destination along the source and destination trees. |
