A valid description will come later, but in short, I'm computing the minimum spanning tree (in blue) and a solution of the traveling salesman problem (in red).

You can hide the blue tree with btn_4 (<c> on a keyboard).
You can hide the red path with btn_5 (<v> on a keyboard).