{"id":"visit-all-points-order-is-fixed","text":"`minimum-time-visiting-all-points/solution.py` visits points strictly in input order — it solves a sequential traversal, not the traveling salesman problem.","truth_value":"IN","source":"entries/2026/06/06/minimum-time-visiting-all-points-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"visit-all-points-order-is-fixed","truth_value":"IN","reason":"premise"}]}}