1 #ifndef FAIF_BREADTH_FIRST_SEARCH_HPP 2 #define FAIF_BREADTH_FIRST_SEARCH_HPP 9 #include "TreeNodeImpl.hpp" 35 std::queue< TreeNode<T>* > buffer;
42 while (!buffer.empty()) {
44 curr = buffer.front();
61 typename TreeNode<T>::Children ch = curr->
getChildren();
78 #endif //FAIF_BREADTH_FIRST_SEARCH_HPP
the concept for node with children
Definition: Node.hpp:44
boost::shared_ptr< T > getPoint() const
Definition: TreeNodeImpl.hpp:45
the struct to create node in search space from individual
Definition: Node.hpp:26
Node< T >::Path searchBreadthFirst(boost::shared_ptr< T > start, int max=200)
The breadth-first search algorithm.
Definition: BreadthFirst.h:30
the template to create the node in tree-based search methods
Definition: TreeNodeImpl.hpp:17
the concept for node with final flag for search in tree-like structures The function 'searchDepthFirs...
Definition: Node.hpp:60
Children getChildren()
Definition: TreeNodeImpl.hpp:95
Node< T >::Path generatePathToRoot() const
Definition: TreeNodeImpl.hpp:135
short getLevel() const
Definition: TreeNodeImpl.hpp:61
bool checkNodeInPath(const TreeNode< T > &n)
Definition: TreeNodeImpl.hpp:82