Abstract: Considering the electric circuit in the abstract and making it an abstract graph in the category of the graph theory, the problem of searching mesh in the circuit is transformed into that to search the minimum independent closed loops in the abstract graph, to which the consistency between mesh and the minimum independent closed loops has been verified. Then, based on the breadth-first search algorithm of graphs, breadth-first based automatic search algorithm namely BSA for the minimum independent closed loops is given with its basic principle and procedure described. Simulation results showed that the algorithm is available to search precisely and efficiently all of the minimum independent closed loops in a graph at high running speed with small memory space occupied. So, it can fully meet the real-time requirements for minimized internal storage.