This code is a solution to the Spacepizza problem, from the battledev) contest ((FR) 11/2017).
-
Notifications
You must be signed in to change notification settings - Fork 0
Given a network, equipped with a specific total and strict order, we get the minimal "round trip" traversal length. It always converges, at quadratic cost.
License
gitcordier/minimal_length_of_graph_traversal
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Given a network, equipped with a specific total and strict order, we get the minimal "round trip" traversal length. It always converges, at quadratic cost.