gistfile1.java

LENGTH = inputParam - 1;
List<Set<Basin>> myBasinSets = new List<HashSet<Basin>>();
Basin[][] basins = new Basin[LENGHT][LENGHT]
for (int i = 0; i < LENGTH; i++) {

        for (int j = 0;  j < LENGTH; j++) {
            Basin currentBasin = basins[i][j];
            if(isSink(currentBasin)) {
                HashSet currentBasinTree = new HashSet<Basin>();
                currentBasinTree.add(currentBasin)
                checkAdjacentBasins(currentBasin, currentBasinTree);
                myBasinSet.add(currentBasinTree);
            }

        }
    }

public checkAdjacentBasins(Basin intialBasin, HashSet<Basin> currentBasinTree) {

    if(intialBasin.x+1 < LENGTH-1 ) {
        downBasin = initialBasin.getDownBasin();
        if(currentBasinTree.get(downBasin) == null) {
            // We haven't checked this direction yet
            boolean treeContinues = checkAdjacentBasin(initialBasin, downBasin, currentBasinTree);
            if(treeContinues) {
                currentBasinTree.add(downBasin);
                checkAdjacentBasins(downBasin, currentBasinTree);
            }
        }
    }

    // repeat for all four directiosn



}

public Basin checkAdjacentBasin(Basin initialBasin, Basin trialBasin,  HashSet<Basin> basinTree) {
    int needsToBeTheLowest = deltaValue(initalBasin, trialBasin);
    if(needsToBeTheLowest <= deltaValue(trialBasin, trialBasin.getDownBasin()) &&
       needsToBeTheLowest <= deltaValue(trialBasin, trialBasin.getUpBasin()) &&
       needsToBeTheLowest <= deltaValue(trialBasin, trialBasin.getRightBasin()) &&
       needsToBeTheLowest <= deltaValue(trialBasin, trialBasin.getLeftBasin())) {
        return true;
    }

    return false;
}
}


}