Refactor step4 of the compute_path_dsjctn
Refactor step4 of the compute_path_dsjctn

Previous implementation selected last candidate in case both routing
and disjunction constraints could not be applied. The new implementation
elaborates an alternate list where each feasible paths satisfyng
disjunction constraint but not route constraint is recorded. The algorithm
then preferably selects a feasible path that satisfies all constraints and
if none is found and route constraint is LOOSE, the first set of paths
that satisfy disjunction is selected (instead of the last one).

Signed-off-by: EstherLerouzic <9136e9bbec0a09a1685b8ebbe677b6c9b26e8f18@orange.com>
Change-Id: Iba44397d105006a98539494d821cc83dc3e3bbd9

Telecominfraproject/gnpy