private static Set<Integer> createSet(int input[], int pos) {
        if(pos == 0) {
            return new HashSet<>();
        }
        Set<Integer> set = new HashSet<>();
        for(int i = 0; i < pos; i++) {
            set.add(input[i]);
        }
        return set;
    }
Date 11/17/2015
@author Tushar Roy

Help Karp method of finding tour of traveling salesman.

Time complexity - O(2^n * n^2)
Space complexity - O(2^n)

https://en.wikipedia.org/wiki/Held%E2%80%93Karp_algorithm
src/com/interview/graph/TravelingSalesmanHeldKarp.java