Draw Paths / Strokes on a Set of Points

Problem You have an undirected graph where vertices represent points and edges represent line segments that need to be drawn. A single stroke begins at any vertex and traces a continuous path along edges, drawing each one as it goes. Every edge must be drawn exactly once across all strokes. You may pass through vertices multiple times, but you cannot draw the same edge more than once. Determine the smallest number of strokes required to draw every edge in the graph. Function…