Structural Bioinformatics Library
Template C++ / Python API for developping structural bioinformatics applications.
T_Cell_complex_shelling_diagram< Cell, IsLowerCell > Member List

This is the complete list of members for T_Cell_complex_shelling_diagram< Cell, IsLowerCell >, including all inherited members.

add_edge(Vertex u, Vertex v)T_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
add_edge(Vertex u, Vertex v, const Directed_acyclic_graph_default_property &p)T_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
add_vertex(unsigned height)T_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
add_vertex(const T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > &p, unsigned height)T_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
SBL::CADS::T_Directed_acyclic_graph::add_vertex(const VertexProperty &p)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inlineprotected
build(typename CellComplexTraits::Cell_complex &complex, bool no_boundary_shell=false, const CellComplexTraits &traits=CellComplexTraits())T_Cell_complex_shelling_diagram< Cell, IsLowerCell >inline
build_from_partially_ordered_set(InputIterator begin, InputIterator end, const PartialOrderPredicate &order)T_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
children_begin(Vertex v) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
children_end(Vertex v) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
Children_iterator typedefT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >protected
clear_children(Vertex v)T_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
clear_parents(Vertex v)T_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
clear_vertex(Vertex v)T_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
Edge typedefT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >protected
edges_begin() constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
edges_end() constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
Edges_iterator typedefT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >protected
find_first_vertex_compared_to_data(const DataType &data, Vertex &v, const Comparator &compare=Comparator()) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
find_vertices_compared_to_data(const DataType &data, OutputIterator out, const Comparator &compare=Comparator()) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
get_child(Edge e) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
get_descendant_ancestor_subgraph(Vertex u, Vertex v, OutputIterator out) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
get_edge(Vertex u, Vertex v) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
get_edge_subgraph(InputIterator begin, InputIterator end, Self &subgraph) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
SBL::CADS::T_Directed_acyclic_graph::get_edge_subgraph(InputIterator begin, InputIterator end, Self &subgraph) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inlineprotected
T_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >::get_graph(void)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inlineprotected
get_height(Vertex v) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
get_induced_subgraph(InputIterator begin, InputIterator end, OutputIterator out) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
get_maximal_elements_from(Vertex v, OutputIterator out) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inlineprotected
get_minimal_elements_from(Vertex v, OutputIterator out) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inlineprotected
get_number_of_children(Vertex v) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
get_number_of_edges(void) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
get_number_of_layers(void) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
get_number_of_parents(Vertex v) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
get_number_of_vertices(unsigned height) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
get_number_of_vertices(void) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
get_orientation(void) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inlineprotected
get_orientation(void)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inlineprotected
get_parent(Edge e) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
get_subgraph(VertexIterator v_begin, VertexIterator v_end, EdgeIterator e_begin, EdgeIterator e_end, Self &subgraph) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
SBL::CADS::T_Directed_acyclic_graph::get_subgraph(VertexIterator v_begin, VertexIterator v_end, EdgeIterator e_begin, EdgeIterator e_end, Self &subgraph) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inlineprotected
Graph typedefT_Cell_complex_shelling_diagram< Cell, IsLowerCell >
has_height(Vertex v) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
increment_maximal_height(unsigned k=1)T_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
is_ancestor(Vertex u, Vertex v) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
is_empty(void) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
is_lower(Vertex u, Vertex v) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inlineprotected
is_maximal_element(Vertex u) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inlineprotected
is_maximal_root_oriented(void) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inlineprotected
is_minimal_element(Vertex u) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inlineprotected
is_parent(Vertex u, Vertex v) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
Layer typedefT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >protected
layer_begin(unsigned height) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
layer_end(unsigned height) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
Layer_iterator typedefT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >protected
maximal_elements_begin() constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inlineprotected
maximal_elements_end() constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inlineprotected
Maximal_elements_iterator typedefT_Directed_acyclic_graph< VertexProperty, EdgeProperty >protected
minimal_elements_begin() constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inlineprotected
minimal_elements_end() constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inlineprotected
Minimal_elements_iterator typedefT_Directed_acyclic_graph< VertexProperty, EdgeProperty >protected
operator[](Vertex v)T_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
operator[](Vertex v) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
operator[](Edge e)T_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
operator[](Edge e) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
Orientation_type typedefT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >protected
parents_begin(Vertex v) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
parents_end(Vertex v) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
Parents_iterator typedefT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >protected
print_in_dot_format(OutputStream &out, bool enforced_rank=true) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
print_in_dot_format(bool enforced_rank=true) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
SBL::CADS::T_Directed_acyclic_graph::print_in_dot_format(OutputStream &out) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >protected
SBL::CADS::T_Directed_acyclic_graph::print_in_dot_format(void) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >protected
remove_edge(Vertex u, Vertex v)T_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
remove_edge(Edge e)T_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
remove_vertex(Vertex v)T_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
set_dot_graph_vertex_label(std::string vlabel)T_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
T_Directed_acyclic_graph(Orientation_type orientation=MAXIMAL_ROOT_ORIENTATION)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inlineprotected
T_Directed_acyclic_graph_with_layers(Orientation_type orientation=Base::MAXIMAL_ROOT_ORIENTATION)T_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
Vertex typedefT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >protected
vertices_begin(void) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
vertices_end(void) constT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >inlineprotected
Vertices_iterator typedefT_Directed_acyclic_graph_with_layers< T_Shelling_diagram_vertex_property< Cell, std::less< Cell > > >protected