Trust score
40/100
MarketNow Registry / Search / iflow-mcp-travelling_salesman_problem_be
iflow-mcp-travelling_salesman_problem_be
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 exact
Search
v0.2.0
by unknown
Install risk
Runs registry code
Source
pypi
Indexed
2026-09-10
Install
$ uvx iflow-mcp-travelling_salesman_problem_beInstalling via npx/uvx/npm install executes arbitrary code from the public registry on your machine. This is the install-risk semantic of the MarketNow catalog — verify the publisher before running it.
How MarketNow scored this
Sentinel Index Heuristics — a security-first estimate from public signals:
- Package age and release activity (stale repositories lose points)
- Verified adoption: registry downloads or GitHub stars, not follower counts
- Typosquat distance against the 150 most-installed MCP packages
- Injection markers scanned in the package description
Heuristic, not a guarantee. For verified agent credentials and revocation, see the MarketNow Trust API.
What is iflow-mcp-travelling_salesman_problem_be?
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 exact Indexed by MarketNow with trust 40/100 (Runs registry code).
How do I install it?
Run $ uvx iflow-mcp-travelling_salesman_problem_be Installing via npx/uvx/npm install executes arbitrary code from the public registry on your machine. This is the install-risk semantic of the MarketNow catalog — verify the publisher before running it.
What does the trust score mean?
Security-first heuristic over public signals (age, adoption, typosquat distance, injection markers). It is not a popularity ranking and not a guarantee of safety. iflow-mcp-travelling_salesman_problem_be scores 40/100.