public double grp_closeness(double [] clo) {
private double grp_closeness(double [] clo) {
    public double grp_closeness(double [] clo) {        int i;        double numv = _graph.numVertices();		double denom = ((numv - 2.0) * (numv - 1.0)) / (2.0 * numv - 3.0);        double group_clo;        double max = -1;        if (denom == 0) {            return 0.0;        }        for (i = 0; i < numv; i++) {            if (clo[i] > max) {                max = clo[i];            }        }        group_clo = 0.0;        for (i = 0; i < numv; i++) {            group_clo += max - clo[i];        }        return (group_clo / denom);    }