An algorithm was presented to construct a flat drawing of the non-planar graph. The source for solution of the problem is a set of isometric cycles of the graph, which allows one to reduce the solution to the discrete optimization methods. Consideration was given to the necessary concepts and structures for solution of the problem of constructing a planar topological graph drawing.