quetzal::coalescence::k_ary_tree< VertexProperty, EdgeProperty > Member List

This is the complete list of members for quetzal::coalescence::k_ary_tree< VertexProperty, EdgeProperty >, including all inherited members.

add_edges(vertex_descriptor parent, std::vector< std::tuple< vertex_descriptor, EdgeProperty > > children)	quetzal::coalescence::k_ary_tree< VertexProperty, EdgeProperty >	inline
add_vertex(const VertexProperty &p)	quetzal::coalescence::k_ary_tree< VertexProperty, EdgeProperty >	inline
degree(vertex_descriptor u) const	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inline
degree_size_type typedef	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >
depth_first_search(vertex_descriptor start, DFSTreeVisitor &vis)	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inline
depth_first_search(vertex_descriptor start, DFSTreeVisitor &vis) const	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inline
directed_category typedef	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >
edge(vertex_descriptor u, vertex_descriptor v) const	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inline
edge_descriptor typedef	quetzal::coalescence::k_ary_tree< VertexProperty, EdgeProperty >
edge_property typedef	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >
find_root_from(vertex_descriptor u) const	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inline
has_predecessor(vertex_descriptor u) const	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inline
has_successors(vertex_descriptor u) const	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inline
in_degree(vertex_descriptor u) const	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inline
in_edge_iterator typedef	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >
in_edges(vertex_descriptor u) const	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inline
is_isomorphic(k_ary_tree_common const &other) const	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inline
k_ary_tree()	quetzal::coalescence::k_ary_tree< VertexProperty, EdgeProperty >	inlineexplicit
k_ary_tree(size_t n)	quetzal::coalescence::k_ary_tree< VertexProperty, EdgeProperty >	inlineexplicit
k_ary_tree_common()	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inlineexplicit
k_ary_tree_common(size_t n)	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inlineexplicit
null_vertex()	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inlinestatic
operator[](vertex_descriptor v) const	quetzal::coalescence::k_ary_tree< VertexProperty, EdgeProperty >	inline
operator[](vertex_descriptor v)	quetzal::coalescence::k_ary_tree< VertexProperty, EdgeProperty >	inline
operator[](const edge_descriptor &edge) const	quetzal::coalescence::k_ary_tree< VertexProperty, EdgeProperty >	inline
operator[](const edge_descriptor &edge)	quetzal::coalescence::k_ary_tree< VertexProperty, EdgeProperty >	inline
out_degree(vertex_descriptor v) const	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inline
out_edge_iterator typedef	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >
predecessor(vertex_descriptor u) const	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inline
source(edge_descriptor e) const	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inline
successors(vertex_descriptor u) const	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inline
target(edge_descriptor e) const	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inline
to_graphviz(std::ostream &out) const	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >	inline
traversal_category typedef	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >
vertex_descriptor typedef	quetzal::coalescence::k_ary_tree< VertexProperty, EdgeProperty >
vertex_property typedef	quetzal::coalescence::detail::k_ary_tree_common< VertexProperty, EdgeProperty, k_ary_tree< no_property, EdgeProperty > >