| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To provide a dual Dijkstra's algorithm for searching a plurality of routes capable of determining not only an optimum route but also a plurality of routes at once, and determining a variety of solutions by avoiding determination of only neighborhoods of the optimum route. <P>SOLUTION: When determining a route from a start point to an end point, shortest costs to all nodes from the start point are determined by Dijkstra's algorithm, shortest costs to all nodes from the end point are determined by Dijkstra's algorithm, and by adding them, a cost of a shortest route connecting the start point and the end point using a node as a pass point is stored in all the nodes, or a shortest route connecting the start point and the end point using a node as a pass point is determined in regard to all the nodes. <P>COPYRIGHT: (C)2003,JPO</p> |
