Current TopologyService can only return short"est" path specifying hop cost function.
This becomes a problem, when an Intent has a constraint about end-to-end path, such as 'there exist a common VLAN label end-to-end'.
When shortest (by hop-cost) paths does not satisfy the constraint,
we would like to need to extend the search scope to next shortest class of paths.
|13393,9||ONOS-6225 Expose k-shortest path search as part of TopologyService.||master||onos||Status: MERGED||+2||+1|