Please help!! Semester Project due in 3 days...........

Question

I have a connectivity problem where I have to select a number of vertices(N) and
connect them with random non repeating edges(M). I have to test with cases
M=.1xNxN, M=.2xNxN,.............M= .9xNxN. Well, it works up to M=.2xNxN when using 10 edges but I get a Stackoverflow error with more than M=.2xNxN.
Please Please help. I have two classes
import java.util.Random;import java.util.Scanner;
* Write a description of class QuickUnion here.
* @author (your name)
* @version (a version number or a date)
public class Union
    private Random generator;
    int E1,E2; int count = 0; int n = 50000;
     int a[] = new int [n];
    int b[] = new int [n];
     //Actual random number generator
     public int Generator(int gen){
         generator = new Random();      
        return generator.nextInt(gen);}
    //Method uses Random Generator to get E1,E2(or p,q) values
    public void Generator(int e1, int e2, int N){
        E1=Generator(N-1);
        E2=Generator(N-1);
        while(E1==E2){E2=Generator(N);}
        check(E1,E2,N);}
    //Method checks both array a and b at the same time for p,q or q,p values already generated
    public void check(int e1, int e2, int N){
        for(int i=0; i<a.length; i++){
            if(((a==e1) && (b[i]==e2)) || ((b[i]==e1) && (a[i]==e2))){
Generator(0,0,N); }}
a[count]=e1; b[count]=e2; count++;
//Methods to view a and b arrays
public void arrayShow(){
for(int k=0; k<a.length; k++){System.out.print(a[k] + " ");
public void arrayShow2(){
for(int k=0; k<a.length; k++){System.out.print(b[k] + " ");
import java.util.*; import java.util.Scanner;
* QUICKFIND QUICKFIND QUICKFIND
* @author Degrion Hill
* @version 3160 Project Program
public class Client2
{public static void main(String[] args)
int answer =0;
int N,E1,E2,counter= 0;
Scanner in = new Scanner(System.in);
// User Input for amount of Vertices
System.out.println("Enter the number of Vertices");
N=in.nextInt();
//Populating Array
int id[] = new int [N];
for(int i = 0; i < N; i++){id[i]=i;}
//User input for amount of edges
System.out.println("Enter the number of edges");
int edges = in.nextInt();
Union test = new Union();
//Random Edge Generator
while(counter<edges){
test.Generator(0,0,N);
//Assignment of Random number to p,q values to make edge
int p = test.E1, q = test.E2;
int t = id[p];
//Quick Find Algorithm
System.out.println("p=" + p + " " + "q=" + q); counter++;
for(int k =0; k < N; k++){
System.out.print(" " + id[k]);}
System.out.print("\n");
if (t==id[q])continue;
for(int i = 0; i<N; i++)
if(id[i]==t) id[i]=id[q];
System.out.println("SORTED");
//Sort the array before Counting groups(Using Bubble Sort)
Sort test2 = new Sort();
test2.bubble(id,0,id.length-1);
for(int m =0; m < N; m++){
System.out.print(" " + id[m]);}
//Count changes in the array(groups)
int y=0; int group=0;
for(int x=0; x<N; x++){
if(x==0){id[y]=id[x];}
if(id[x] != id[y]){id[y]=id[x];group++;}}
System.out.println();
System.out.println(group+1 + " Group/s");
System.out.print("");
System.out.println("Run Again? [1 for YES, 2 for NO]");
answer=in.nextInt();
//(Testing) Shows a and b arrays to see if ALL cases for p,q are there
if(answer==1){main(args);} test.arrayShow(); System.out.println(""); test.arrayShow2();

Answer 1

Whithout diving into your code: StackOverFlowError occurs usually if you do a recursion and don't stop it before memory blows.