Analysis of the Shortest Repaired Path of Distribution Network Based on Dijkstra Algorithm

摘要

Dijkstra algorithm has been applied widely in calculating the shortest repaired path of distribution network, however, the running time of which will increase drastically with the added number of the node. An improved Dijkstra algorithm based on the heapsort method of the complete binary tree is proposed, in which the operation on the priority queue is implemented by using the complete binary tree and the node data is stored in three-element compression storage structure. The calculation process has been optimized in some degree and the running time of the algorithm reduced to O(n*lgn). In this article, a graph with fifty-four nodes of distribution network is used as a model to validate the validity of the algorithm. Experiment shows that the accuracy, stability and search efficiency of this algorithm are better than others.