A direct method for calculating cell cycles of a block map of a simple planar graph

The proposed algorithm for calculating the cycles of the cells the simple planar graph block map is an extension of the classical depth-first search algorithm for cycles of the DFS-basis. The key idea of the modification of this algorithm is the strategy of right-hand traversal when passing the graph in depth. The vertex with the minimum coordinate on the OY axis is assigned as the starting vertex in the right-hand traversal. The exit from the initial vertex is performed along the edge with the minimum polar angle. The continuation of the traversal from each next vertex is carried out along an edge with a minimum polar angle relative to the edge along which arrived at the current vertex. A two-level structure of nested cycles is introduced. This is the main level and the zero level of nesting. All cycles of the basis belong to the main level. Each of the cycles can additionally have a zero level of nesting in another main cycle for it, if it is nested in the main cycle and not nested in any other cycle from the main cycle. With the right-hand traversal, zero nesting cycles are adjacent to the main cycle and do not have common vertices outside the main cycle. These two properties allowed in each basis cycle sequentially select and exclude from it all its zero nesting cycles, using the symmetric difference operation. It is shown that the rest of the basic cycle is the cycle of the block map cell. The complexity of each step of the proposed algorithm does not exceed the quadratic complexity with respect to the number of vertices of the simple planar graph.