{'fraction_non_alphanumeric': 0.014450867052023121, 'fraction_numerical': 0.0, 'mean_word_length': 5.453416149068323, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Network topology identification algorithm based on adjacency matrix

Power grid topology identification is not only an important part of advanced software for the distribution network management system, but also the basis for a variety of analytical calculations. The paper presents a new method to speed up the power grid topology identification, which solving the disadvantages of the matrix large computation and slow computation speed. With the node-branch incidence matrix representation of the topological structure of the network is the basic method, through the definition of matrix “or” or “and” operation and switch state vector, and achieve rapid dynamic changes in the network topology by using the symmetric elimination to reduce the order number of the adjacency matrix and the apply symmetry to the process of finding the connected matrix. Compared with the traditional algorithm, the algorithm can reduce the amount of calculation and accelerate the computation speed, suitable for topology analysis of complex power grid.