抄録
Contours of a closed one stroke drawn curve virtually constitute two Eulerian circuits. They are made up of the identical vertices and edges but are different circuits, assuming the curve is very narrow. They constitute two different edge cycle sets, both of which are disjoint edge cycle sets of Eulerian graph. They can be bi-partitioned based on the adjacency between two cycles. Each of the bi-partitioned cycle sets can be merged into one single cycle, which is essentially the solution path of the maze. These two maze paths go through all parts of the originally drawn curve.