Log In  

1

Cart [#46225#] | Copy | Code | 2017-11-13 | Link
1

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

Log in to post a comment

user:
password:

New User | Account Help
:: New User
X
About | Contact | Updates | Terms of Use
Follow Lexaloffle:        
Generated 2017-11-22 09:07 | 0.249s | 1572k | Q:17