Log In  
Log In  

Cart [#46225#] | 2017-11-13 | License: CC4-BY-NC-SA | Embed

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).

P#46228 2017-11-13 10:00 ( Edited 2017-11-13 15:00)

[Please log in to post a comment]

About | Contact | Updates | Terms of Use
Follow Lexaloffle:        
Generated 2018-12-19 13:32 | 0.021s | 2097k | Q:18