public int mostConnections() {
        int x = 0;
        int biggest = 0;
        for (int i = 0; i< n; i++) {
            if (adj[i].size() > x ) {
                x = adj[i].size();
                biggest = i;
            }
        }
    return biggest;
    }