Topology Algorithm of Power Network Based on Breadth-First-Search
Lin Wei Li, Xing He, Lian Ming Zhang
Abstract
Lin Wei Li, Xing He, Lian Ming Zhang
Abstract
Aiming at the defects of repeating searching the path, low efficiency and the slow speed of the traditional topology algorithm, proposes a network topology algorithm based on Breadth-First-Search in this paper.Introduces the topology modeling method,and the electric equipment is abstracted into nodes and branches,making the topology process not constrained by the network connection and structure,enhancing universal property of the algorithm.Then introduces the traditional method, and analysises the disadvantages. At the same time,puts forward a new method. Uses node-branch adjacency list in the new method,which improves the topology speed.When the local switch information is changed, can modify the node-branch adjacency list to conduct the local re-topology,so it improves the topology flexibility. Finally, through the example, proves the superiority and practicability of this algorithm.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Aiming at the defects of repeating searching the path, low efficiency and the slow speed of the traditional topology algorithm, proposes a network topology algorithm based on Breadth-First-Search in this paper.Introduces the topology modeling method,and the electric equipment is abstracted into nodes and branches,making the topology process not constrained by the network connection and structure,enhancing universal property of the algorithm.Then introduces the traditional method, and analysises the disadvantages. At the same time,puts forward a new method. Uses node-branch adjacency list in the new method,which improves the topology speed.When the local switch information is changed, can modify the node-branch adjacency list to conduct the local re-topology,so it improves the topology flexibility. Finally, through the example, proves the superiority and practicability of this algorithm.
Key concepts: Adjacency list, Topology (electrical circuits), Node (physics), Computer science, Network topology, Breadth-first search, Path (computing), Search algorithm