stack over flow eror.there is infinite loop because of recursion

[jihad]

there is infinite loop because of recursion but where is get into infinite loop I couldnt understand

Scanner input = new Scanner(System.in);
List<node> list = new LinkedList<node>();
Random randomGenerator = new Random();
List<node> queue = new LinkedList<node>();
int time = 0;
int counter2=0;

public void dfs() {

for (int i = 0; i < list.size(); i++) {
list.get(i).setcolor("white");
list.get(i).setpredecessor(null);
}
time = 0;
for (int i = 0; i < list.size(); i++) {
if (list.get(i).getcolor().equals("white")) {
dfsvisit(i);
}
for (int s = 0; s < list.size(); s++) {
System.out.println(list.get(s).getnode() + " visit time is " + list.get(s).visiTTime);
System.out.println(list.get(s).getnode() + " finish time is " + list.get(s).FinishTime);
}
}
}

public void dfsvisit(int i) {
counter2++;
System.out.println("\ncounter2 "+counter2);
time = time + 1;
list.get(i).visiTTime = time;
list.get(i).setcolor("gray");
for (int v = 0; v < list.get(i).connectedVertexes.size(); v++) {
if (list.get(i).connectedVertexes.get(v).getcolor().e quals("white"))
{
list.get(i).connectedVertexes.get(v).setpredecesso r(list.get(i));
dfsvisit(v);

}
}
list.get(i).setcolor("black");
time = time + 1;
list.get(i).FinishTime = time;
}

[JosAH]

Add a couple of System.out.println( ... ) statements and run your algorithm on a well known (small) network/graph and see what happens.

kind regards,

Jos

[DarrylBurke]

Guide For New Members
BB Code List - Java Programming Forum - Learn Java Programming

db