Display electronic gun display a Chinese character, draw all the strokes, find the shortest path algorithm. Ask for discussion



Title.
Personally think there are two kinds of ideas, the first is to boil down to the problem of travel quotient, using branch-bound method or other methods to solve. Suppose a Chinese character has n strokes, it corresponds to a 2n point pair. With each draw, there are 2 fewer options, so the total amount of solution space is 2n*2 (n-1) *...*2.

The second is due to the Chinese postman problem, go through a connected graph all sides, how to walk the shortest path, by adding some redundant edges, but also can get the best solution. But Chinese characters may not be a connected graph, how to do? Perhaps it is possible to extend this to a connected graph by calculating the positional relationship of each stroke of the Chinese character.

Feel the first method to be concise, easy to handle.
Would you mind?

Display electronic gun display a Chinese character, draw all the strokes, find the shortest path algorithm. Ask for discussion