Improved diffluence algorithm and its application to the best repairing path for distribution network

To find the best repairing path at the shortest time is important for distribution network GIS (geography information system) faults to recovery quickly. After analyzing the existing methods which are usually based on the quantity of nodes, and the time complexities keep in the level of O (n*n), this paper designs an improved Diffluence algorithm whose time complexity is O (m) (m is the number of edges of the shortest path). The efficiency to calculate the best path is improved. Then a mathematical model in distribution network GIS best repairing path that is based on the improved diffluence algorithm is proposed. The paper describes the structure of similar across link list which is used to store network topology when the road condition is considered, and deals with some key algorithms. At last, an instance of distribution network GIS best repairing path considering road condition proves that the efficiency of the improved diffluence algorithm is high.