摘要 |
<p>PROBLEM TO BE SOLVED: To easily classify links in an area. SOLUTION: In step 11, an optimum route is given in a tree-shaped structure with links as branches. In step 12, the links included in the optimum route found from the links are obtd. In step 14, these links are defined as a first group. In step 13, among the links, the links with a start point and an end point reversed in the first group are obtd. In step 15, such links are defined as a second group. In step 16, the links having no recessed start and end points in the first group are defined as a third group or defined as the first or second group. In a step 17, the steps 12-16 are repeated as for all the links in the area.</p> |