search

lounick / task_scheduling

BSD 3-Clause "New" or "Revised" License
4 stars 3 forks source link

Generalise the op_solver to work with aribtrary start and end points #2

Closed lounick closed 8 years ago

lounick commented 8 years ago

The current state of the orienteering problem solver assumes that the first point (0) in the cost matrix is the starting point and that the last (n-1) is the finishing point.

It should be generalised to be working with any point. Even with the case of the starting and ending point being the same.

decabyte commented 8 years ago

:+1: for this one

lounick commented 8 years ago

Fixed in https://github.com/lounick/task_scheduling/commit/be4208a2577d6d6ebf7bd14f0b4ea484fefdf31b