Breadth First Search in java

[alaa123]

hi
plz do not ignore me I really neeed ur help
I am working on a progarmme to implement First Search and Breadth Search
I did the first search algorithm but I need help with implementing the Breadth Search algorithm plz help me
I have the methods but i want to know what to change inorder to implemnet Breadth first search


import java.util.*;

public class DFS{

Vertex startv;
Vertex endv;
Vector<AlgNode> q = new Vector<AlgNode> (10,10);
AlgNode start;

public DFS(Vertex startv, Vertex endv){

this.startv = startv;
this.endv = endv;
start = new AlgNode(startv) ;
q.add(start);
search();
}

public void search(){

AlgNode currentAN=null;

if((startv==nul l)||(endv==null )){

return;
}

boolean found = false;

search:
while(q.size()> 0){

currentAN = q.get(0);
q.remove(0);

Vertex v = currentAN.getVe rtex();

if(v.equals(end v)){
found = true;
break search;
}else{

AlgNode[] cs= currentAN.expan d();
for(int i = cs.length-1; i>=0; i--){

q.insertElement At(cs[i], 0);
}

}


}

if (found == true){

System.out.prin tln("Path Successfully Found");

Vertex[] as = currentAN.getAn cestors();

for(int i =0; i<as.length; i++){

System.out.prin tln(as[i].getNodeName()) ;
}
System.out.prin tln(endv.getNod eName());

}
else System.out.prin tln("No Possible Path");


}

}

[r035198x]

hi
plz do not ignore me I really neeed ur help
I am working on a progarmme to implement First Search and Breadth Search
I did the first search algorithm but I need help with implementing the Breadth Search algorithm plz help me
I have the methods but i want to know what to change inorder to implemnet Breadth first search


import java.util.*;

public class DFS{

Vertex startv;
Vertex endv;
Vector<AlgNode> q = new Vector<AlgNode> (10,10);
AlgNode start;

public DFS(Vertex startv, Vertex endv){

this.startv = startv;
this.endv = endv;
start = new AlgNode(startv) ;
q.add(start);
search();
}

public void search(){

AlgNode currentAN=null;

if((startv==nul l)||(endv==null )){

return;
}

boolean found = false;

search:
while(q.size()> 0){

currentAN = q.get(0);
q.remove(0);

Vertex v = currentAN.getVe rtex();

if(v.equals(end v)){
found = true;
break search;
}else{

AlgNode[] cs= currentAN.expan d();
for(int i = cs.length-1; i>=0; i--){

q.insertElement At(cs[i], 0);
}

}


}

if (found == true){

System.out.prin tln("Path Successfully Found");

Vertex[] as = currentAN.getAn cestors();

for(int i =0; i<as.length; i++){

System.out.prin tln(as[i].getNodeName()) ;
}
System.out.prin tln(endv.getNod eName());

}
else System.out.prin tln("No Possible Path");


}

}

1.)When posting code please use code tags
2.)Do you know the algorithm for BFS?
3.)It is not very good to use labels for flow control.

[alaa123]

Hello
YES i KNOW THE ALGORITHM BUT NOT SURE HOW TO IMPLEMENT IT
i have the DFS algorithm as beleow but how can i do the BFS what do i need to chande or add

PLZ REALLY NEED UR HELP

import java.util.*;

public class DFS{

Vertex startv;
Vertex endv;
Vector<AlgNode> q = new Vector<AlgNode> (10,10);
AlgNode start;

public DFS(Vertex startv, Vertex endv){

this.startv = startv;
this.endv = endv;
start = new AlgNode(startv) ;
q.add(start);
search();
}

public void search(){

AlgNode currentAN=null;

if((startv==nul l)||(endv==null )){

return;
}

boolean found = false;

search:
while(q.size()> 0){

currentAN = q.get(0);
q.remove(0);

Vertex v = currentAN.getVe rtex();

if(v.equals(end v)){
found = true;
break search;
}else{

AlgNode[] cs= currentAN.expan d();
for(int i = cs.length-1; i>=0; i--){

q.insertElement At(cs[i], 0);
}

}


}

if (found == true){

System.out.prin tln("Path Successfully Found");

Vertex[] as = currentAN.getAn cestors();

for(int i =0; i<as.length; i++){

System.out.prin tln(as[i].getNodeName()) ;
}
System.out.prin tln(endv.getNod eName());

}
else System.out.prin tln("No Possible Path");


}

}

[r035198x]

Hello
YES i KNOW THE ALGORITHM BUT NOT SURE HOW TO IMPLEMENT IT
i have the DFS algorithm as beleow but how can i do the BFS what do i need to chande or add

PLZ REALLY NEED UR HELP

import java.util.*;

public class DFS{

Vertex startv;
Vertex endv;
Vector<AlgNode> q = new Vector<AlgNode> (10,10);
AlgNode start;

public DFS(Vertex startv, Vertex endv){

this.startv = startv;
this.endv = endv;
start = new AlgNode(startv) ;
q.add(start);
search();
}

public void search(){

AlgNode currentAN=null;

if((startv==nul l)||(endv==null )){

return;
}

boolean found = false;

search:
while(q.size()> 0){

currentAN = q.get(0);
q.remove(0);

Vertex v = currentAN.getVe rtex();

if(v.equals(end v)){
found = true;
break search;
}else{

AlgNode[] cs= currentAN.expan d();
for(int i = cs.length-1; i>=0; i--){

q.insertElement At(cs[i], 0);
}

}


}

if (found == true){

System.out.prin tln("Path Successfully Found");

Vertex[] as = currentAN.getAn cestors();

for(int i =0; i<as.length; i++){

System.out.prin tln(as[i].getNodeName()) ;
}
System.out.prin tln(endv.getNod eName());

}
else System.out.prin tln("No Possible Path");


}

}

You are not doing a good job of following instructions.
The label is still there and you posted code without code tags.

Now no one is going to write the code for you. If you know the algorithm for BFS then try to convert that into Java code and post if you get any problems.