Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- while (true){
- for (Vertex v : searchTree){
- if (v.equals(target)){
- return count;
- }
- else if (v.equals(searchTree[-1])){
- searchTree.addAll(getNeighbours(graph, v));
- count++;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement