The invention relates to a BFS-based searching method for distribution network loops and belongs to the technical field of power system topology structure designing. The method comprises the steps that firstly, a distribution network model is established, the level number of a feeder root node is initialized to be one, the level numbers of other nodes are initialized to be -1, and link sets are initialized to be empty sets; starting from the root node, BFS is performed, the set memberships between the level numbers of the nodes and upper and lower level nodes are sequentially set, and in the process of searching for the (i+1)th level nodes through the ith level nodes, if the level numbers of the searched nodes are not -1 or i-1, line segments between the nodes, namely the current searched nodes, are added into the link sets; unless the link sets are empty, the number of the line segments in the link sets is the number of the distribution network loops, traversal is performed on the line segments in the link sets, upward searching is performed from the nodes at the two ends of each line segment, searching is stopped until father nodes of the corresponding two nodes are the same node or the root node, and experienced paths are the loops. According to the method, the loops in the power distribution network can be analyzed quickly and accurately.