Skip to content

Can you ignore node-0 in brute force attempts? #32

Open
@thatcode

Description

@thatcode

The comment on https://github.com/fillipe-gsm/python-tsp/blob/master/python_tsp/exact/brute_force.py#L32 says:
However, we can fix node 0 and permutate only the remaining.

This is true for closed loops - once you've found the best you can rotate the loop until any node you want is node 0.

Is it really true for open loops? I haven't worked out a counter example yet, but I'm sure one can exist with not much effort!

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions