Breadth-first direct-current converter station recovery path generation method

The invention discloses a breadth-first direct-current converter station recovery path generation method with the purpose that the recovery time of a direct-current converter station is the shortest, a local optimal power transmission path of a power supply to be recovered is searched based on a Dijkstra shortest path method, and the recovery path of the direct-current converter station is optimized based on a breadth-first method. The method comprises the steps of: 1, utilizing the Dijkstra algorithm to search for the shortest path from a live-line system to the power supply to be recovered; 2, carrying out technical verification on the power supply to be recovered and the recovery path thereof, wherein the content of the technical verification includes machine set start time and start power constraint, reactive and self excitation constraint, load flow and node voltage constraint and direct current start condition constraint; and 3, based on the breadth-first principle, searching for the power supply to be recovered, and optimizing the recovery path of the direct-current converter station. According to the invention, with the purpose of the shortest recovery time of the direct-current converter station, the direct-current converter station is preferentially started, and large-capacity of active power can be provided for the subsequent recovery of a failed power grid, and the recovery process of a power-off system is accelerated.