Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
.gitignore		.gitignore
LICENSE		LICENSE
README.md		README.md
input_pizza.txt		input_pizza.txt
spacepizza.pdf		spacepizza.pdf
spacepizza.py		spacepizza.py

Repository files navigation

Introduction

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

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.

github.com/gitcordier/minimal_length_of_graph_traversal

minimization salesman-problem graph-traversal minimizer minimization-algorithm

Report repository

Contributors

Languages

Python 100.0%