应用Matlab编程计算最长门路及中位点选址(国外英文资料).docVIP

利用Matlab编程计算最短路径及中位点选址(国外英文资料) Measuring geography (xu jianhua, education press, 2005) § 19. Matlab is used to calculate the shortest path and site location The short circuit problem The shortest path between two specified vertices. For example, a railway network connects a number of towns, and a shortest line between two designated towns in the network. At the peak of the town, the direct railway between the two towns is illustrated by the edges between the two vertices. For each side of the line, the right to the right of a real number, the length of the direct line, is called the right of empowerment. The power of the subgraph is the right of the edges of the subgraph. The problem is to find the path between the two vertices specified in the empowerment diagram. This is called the shortest circuit between the two, and it is called the distance between the two. Dix algorithm: the short circuit has been mature, Dijkstra algorithm, the basic idea is according to the order from from near to far and, in turn, may be the most short circuit and the distance of each vertex until (or until all the vertices), end of the algorithm. In order to avoid duplication and keep the calculation information for each step, the label algorithm is adopted. Here is the algorithm. (I) order, yes, yes. (ii) for each () Instead. Calculate, lets call it a vertex that reaches this minimum. (iii) if, stop; If, replace, turn (ii). The end of the algorithm is given by the final label of the distance from each vertex. Before entering, the label is called the T label, and the name of the entry is the P label. The algorithm is to constantly modify the dots T label until it gets the P label. If in the process of algorithm is run, will obtain the P label each vertex origin edge indicated on the diagram, at the end of the algorithm, to the point of the short circuit also marked on the diagram. Example 1: a company has a branch in six cities, and the ticket price from direct voyage is recorded in the