L-system specification of knot-insertion rules for non-uniform B-spline subdivision

The Research Of Multipath Query Implementation Based On The City's Public Transportation System

“…Heuristic search in the search process is the feature of joined the heuristic information, A* algorithm is put forward in the 1960 s, is very important in the heuristic algorithm and efficient algorithms, as one kind of heuristic search algorithm, is the most effective for solving the shortest path in the static network [6], the method of choice by A heuristic function, the current search nodes selection near the least step nodes as the search, when more than one of the least node, the node and connect their side, there are multiple node path, each edge length are given path value this is A graphics in the plane, finally asked out by the cost of the generation algorithm. A* algorithm is the core part, choose the path between the start node to the destination node value minimum sequence of nodes to achieve the shortest path search.…”