[C/C++] [Suche] Tiefen - Breitensuch Algorithmus mit vorgegebenen punkten

class Node
{
 private Node parent;
 private List<Node> children;
 
 public Node(Node parent)
 {
 this.parent = parent;
 this.children = new ArrayList<Node>();
 }
 
 public List<Node> getChildren()
 {
 return children;
 }
 
 public void addChild(Node node) {...}
}

public boolean breadthFirstSearch(Node root, Node goal)
{
 Queue<Node> agenda = new LinkedList<Node>();
 agenda.add(root);
 
 while(!agenda.isEmpty())
 {
 Node current = agenda.poll();
 if(goal.equals(current))
 {
 return true;
 } else
 {
 for(Node child : current.getChildren())
 {
 agenda.add(child);
 }
 }
 }
 
 return false;
}