private List<List<Integer>> constructMaxSet(int[][] costMetric)
{
int level = 1;
MaximalSet set = new MaximalSet(costMetric);
List<List<Integer>> leaders = new LinkedList<List<Integer>>();
boolean check = false;
while (check == false)
{
List<Integer> leader = set.getMaximalSet(level++);
leaders.add(leader);
for (int i = 0; i < costMetric.length; i++)
{
if (leader.contains(i + 1))