Optimize a GCODE file by reducing the total time spent moving the bit (G0) vs cutting or carving (G1)

• should work with gcode from Easel
• fast optimization using the 2-opt algorithm that is commonly used for solving the Traveling Salesman Problem.
• option to show/hide travel/cutting/z changes.
• reports what you save (in term of total distance)
• download the optimized file

• hard-coded work area of 512x512

If you encounter a bug or have a gcode file that wasn't handled properly, please create an issue with the relevant file attached and I will take a look at it.

Any help is appreciated. Send in a PR or reach out to me.

Thank to @pedrohfsd for his javascript version of the 2-opt algorithm. I used it because it was easy to understand and adapt.