Function lasy::euler_graph_to_euler_circuit

pub fn euler_graph_to_euler_circuit<P>(
    points: &[P], 
    eg: &EulerGraph
) -> EulerCircuit where
    P: Position, 

Given a Euler Graph describing the vector image to be drawn, return the optimal Euler Circuit describing the path over which the laser should travel.

This is Hierholzer's Algorithm with the amendment that during traversal of each vertex the edge with the closest angle to a straight line is always chosen.