Factual package intelligence from PyPI

iflow-mcp-travelling_salesman_problem_be 0.2.0 package intelligence

The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatoria

pip install iflow-mcp-travelling-salesman-problem-be

Current version
0.2.0
Python requirement
>=3.10
License
Not declared
Distribution type
Pure Python wheel
Release files
2 (1 wheels, 1 source)
Download size
24.4 KiB
Release history
1 releases with files
Median release cadence
Not enough dated releases

iflow-mcp-travelling_salesman_problem_be dependencies

PyPI declares 3 unique dependency rules for this release. Environment markers are shown when supplied by the project.

  1. mcp >=1.6.0
  2. pyyaml >=6.0.2
  3. jinja2 >=3.0.0

Compatibility and release files

iflow-mcp-travelling_salesman_problem_be publishes 1 wheel and 1 source archive for version 0.2.0. Wheel platform tags: any.

No version-specific Python classifiers are declared.

Metadata completeness

PyPI does not currently declare: license, project URL. PyDeps marks these fields as unknown instead of guessing values.

Release activity and sources

PyPI lists 1 release with files. The first dated release is ; 1 release falls within the 365 days preceding the latest dated release. The current release files were uploaded on .

The project does not publish external project URLs in its PyPI metadata.