计算机专业英语翻译请帮忙

[关于祝你新年快乐的英语作文50字数多]您好：Spring Festival is a favorite of children a day, I was no exception. This year's Spring Festival, I am particularly pleased that you want to know why? It is...+阅读

Combined with the psychological analysis, passengers to transfer target for the least number bus ride model. In transit network modeling, comprehensive consideration of the bus stops, the spatial relations, spatial data model to search to the topology of the network modeling of transport model of double. Through the search model, the minimum number of transfer between two problem is transformed into solving the shortest path problem. In the search algorithm is proposed for the first time, the design of the transformation of the right side for 1 Dijktra algorithm based on the design of precursor node algorithm. And as the premise, precursor node algorithm design all the shortest path algorithm can efficiently solve the interchange between two times all the smallest. Finally, in dalian as an example, the data bus verified the feasibility of the model and algorithm of solutions. Algorithm by theorem 4: that everyone on the shortest path, it is the path to the starting point for a shortest path, namely the closest to the starting point of all the shortest path in all points of the shortest path, namely, by the former The displacement node algorithm are also accepts the precursor node in the shortest path, it is all a shortest path algorithm using precursor node algorithm. Using linear table PrevList (of any node meshes) mouth I precursor nodes are stored. Linear list each form contains two fields NodeName and PrevNodePoint, on behalf of the node name and its linear table pointer precursor node. Algorithm procedures are as follows:

(1) input starting point and bashan, % initialization shortest path tree roots node, PrevList (%) = NULL, NodeN0me = Vd, PrevNodePoint_PrevList (Vd).

(2) through the precursor node algorithm Vi (initial start by %) in the shortest path on all their precursors node, according to the sequence is stored in a linear table PrevList (make). Thus the shortest path tree qq in child node.

(3) PrevList (make) by the parent node is calculated separately, and the obtained the precursor node of node respectively in their respective point of storage PrevList linear list of precursor node. Repetitive execution

(4)

(2),

(3), PrevList (q) until the {}, % = according to each node of the PrevNodePoint pointer, constructing the shortest path tree leaf node, the root node to back to a shortest path algorithm. The algorithm analysis: all the shortest path algorithm based on precursor node, for each algorithm of finding a precursor to node Dijkstra algorithm of a node, which is equivalent to its precursors found each node of a node must perform a jumping kstra algorithm. Figure in e G, in the worst cases, all sides in the shortest path algorithm, so that the worst time complexity is O (P (+), z), the equivalent of 0

(2) : r /.