gitcordier/minimal_length_of_graph_traversal

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.

Introduction

This code is a solution to the Spacepizza problem, from the battledev) contest ((FR) 11/2017).