GitHub / 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.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gitcordier%2Fminimal_length_of_graph_traversal
PURL: pkg:github/gitcordier/minimal_length_of_graph_traversal
Stars: 0
Forks: 0
Open issues: 0
License: mit
Language: Python
Size: 85.9 KB
Dependencies parsed at: Pending
Created at: almost 5 years ago
Updated at: over 4 years ago
Pushed at: almost 5 years ago
Last synced at: 2 months ago
Topics: graph-traversal, minimization, minimization-algorithm, minimizer, salesman-problem