Quetzal-CoaTL
The Coalescence Template Library
Loading...
Searching...
No Matches
Classes | Public Types | Public Member Functions | Protected Member Functions | Protected Attributes | Friends | List of all members
boost::detail::binary_tree_base< Vertex, Node > Class Template Reference

Classes

class  out_edge_iterator
 
struct  vertex_iterator
 

Public Types

typedef Vertex vertex_descriptor
 
typedef std::pair< vertex_descriptor, vertex_descriptor > edge_descriptor
 
typedef disallow_parallel_edge_tag edge_parallel_category
 
typedef std::size_t degree_size_type
 
typedef std::size_t vertices_size_type
 

Public Member Functions

BOOST_STATIC_CONSTEXPR vertex_descriptor null_vertex ()
 
 binary_tree_base (Vertex n)
 
std::size_t num_vertices () const
 
Node const & operator[] (vertex_descriptor u) const
 
template<std::size_t N>
bool has_successor (vertex_descriptor u) const
 
void clear ()
 
void shrink_to_fit ()
 

Protected Member Functions

std::pair< edge_descriptor, bool > add_edge (vertex_descriptor u, vertex_descriptor v)
 
std::pair< edge_descriptor, bool > add_edge_strict (vertex_descriptor u, vertex_descriptor v)
 
void remove_edge (vertex_descriptor u, vertex_descriptor v)
 
vertex_descriptor add_vertex ()
 
bool add_vertex (vertex_descriptor u)
 
void remove_vertex (vertex_descriptor u)
 
void clear_vertex (vertex_descriptor u)
 
edge_descriptor add_left_edge (vertex_descriptor parent, vertex_descriptor child)
 
edge_descriptor add_right_edge (vertex_descriptor parent, vertex_descriptor child)
 

Protected Attributes

std::vector< Node > nodes
 
std::vector< Vertex > free_list
 

Friends

vertex_descriptor source (edge_descriptor e, binary_tree_base const &)
 
vertex_descriptor target (edge_descriptor e, binary_tree_base const &)
 
std::pair< out_edge_iterator, out_edge_iterator > out_edges (vertex_descriptor u, binary_tree_base const &g)
 
degree_size_type out_degree (vertex_descriptor v, binary_tree_base const &g)
 
std::size_t num_vertices (binary_tree_base const &g)
 
std::pair< vertex_iterator, vertex_iterator > vertices (binary_tree_base const &g)
 
vertex_descriptor add_vertex (binary_tree_base &g)
 
void remove_vertex (vertex_descriptor u, binary_tree_base &g)
 
bool has_left_successor (Vertex u, binary_tree_base const &g)
 
bool has_right_successor (Vertex u, binary_tree_base const &g)
 
Vertex left_successor (Vertex u, binary_tree_base const &g)
 
Vertex right_successor (Vertex u, binary_tree_base const &g)
 
Vertex default_starting_vertex (binary_tree_base const &g)
 
The documentation for this class was generated from the following file: