#include <traversal_forest.hpp>
Public Types | |
using | backing_container_t = std::conditional_t< order==forest_order::depth_first, std::stack< T >, std::queue< T > > |
Public Member Functions | |
void | add (T const &val) |
void | add (T const &hot, T const &distant) |
auto | next () |
auto | peek () |
auto | empty () |
auto | size () |
A template for storing nodes in order to traverse them in the indicated order
using ML::experimental::forest::detail::traversal_container< order, T >::backing_container_t = std::conditional_t<order == forest_order::depth_first, std::stack<T>, std::queue<T> > |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |