https://github.com/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.
https://github.com/gitcordier/minimal_length_of_graph_traversal

graph-traversal minimization minimization-algorithm minimizer salesman-problem

Last synced: 8 months ago
JSON representation

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.

• Host: GitHub
• URL: https://github.com/gitcordier/minimal_length_of_graph_traversal
• Owner: gitcordier
• License: mit
• Created: 2020-07-10T14:17:34.000Z (almost 6 years ago)
• Default Branch: master
• Last Pushed: 2020-07-27T14:48:39.000Z (almost 6 years ago)
• Last Synced: 2025-04-12T08:57:14.902Z (about 1 year ago)
• Topics: graph-traversal, minimization, minimization-algorithm, minimizer, salesman-problem
• Language: Python
• Homepage: https://github.com/gitcordier/minimal_length_of_graph_traversal
• Size: 85.9 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Introduction 

This code is a solution to the 

[*Spacepizza* problem](https://questionsacm.isograd.com/codecontest/pdf/spacepizza.pdf), 

from the 

[battledev](https://battledev.blogdumoderateur.com/)) 

contest ((FR) 11/2017).