'Perform some magic in order to get a nice graph
:return: A normalized distance dict'

def _normalize_distances(self, dist_dict):

    max = 0
    for d in dist_dict.values():
        if (d > max):
            max = d
    min = dist_dict.values()[0]
    for d in dist_dict.values():
        if (d < min):
            min = d
    sum = 0
    for d in dist_dict.values():
        sum += d
    avg = (sum / len(dist_dict))
    res = {}
    for (r1, r2) in dist_dict:
        actual_value = dist_dict[(r1, r2)]
        if (actual_value > avg):
            new_value = avg
        else:
            new_value = actual_value
        if (actual_value < 0.1):
            new_value = (min + (avg / 3))
        res[(r1, r2)] = new_value
    return res
