Structural Bioinformatics Library
Template C++ / Python API for developping structural bioinformatics applications.
T_Directed_acyclic_graph< VertexProperty, EdgeProperty > Member List

This is the complete list of members for T_Directed_acyclic_graph< VertexProperty, EdgeProperty >, including all inherited members.

add_edge(Vertex u, Vertex v)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
add_edge(Vertex u, Vertex v, const EdgeProperty &p)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
add_vertex(void)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
add_vertex(const VertexProperty &p)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
build_from_partially_ordered_set(InputIterator begin, InputIterator end, const PartialOrderPredicate &order=PartialOrderPredicate())T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
children_begin(Vertex v) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
children_end(Vertex v) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
Children_iterator typedefT_Directed_acyclic_graph< VertexProperty, EdgeProperty >
clear(void)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
clear_children(Vertex v)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
clear_parents(Vertex v)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
clear_vertex(Vertex v)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
Edge typedefT_Directed_acyclic_graph< VertexProperty, EdgeProperty >
edges_begin() constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
edges_end() constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
Edges_iterator typedefT_Directed_acyclic_graph< VertexProperty, EdgeProperty >
find_first_vertex_compared_to_data(const DataType &data, Vertex &v, const Comparator &compare=Comparator()) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
find_vertices_compared_to_data(const DataType &data, OutputIterator out, const Comparator &compare=Comparator()) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
get_child(Edge e) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
get_descendant_ancestor_subgraph(Vertex u, Vertex v, OutputIterator out) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
get_edge(Vertex u, Vertex v) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
get_edge_subgraph(InputIterator begin, InputIterator end, Self &subgraph) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
get_graph(void) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
get_graph(void)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
get_induced_subgraph(InputIterator begin, InputIterator end, OutputIterator out) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
get_maximal_elements_from(Vertex v, OutputIterator out) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
get_minimal_elements_from(Vertex v, OutputIterator out) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
get_number_of_children(Vertex v) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
get_number_of_edges(void) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
get_number_of_parents(Vertex v) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
get_number_of_vertices(void) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
get_orientation(void) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
get_orientation(void)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
get_parent(Edge e) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
get_subgraph(VertexIterator v_begin, VertexIterator v_end, EdgeIterator e_begin, EdgeIterator e_end, Self &subgraph) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
Graph typedefT_Directed_acyclic_graph< VertexProperty, EdgeProperty >
is_ancestor(Vertex u, Vertex v) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
is_empty(void) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
is_lower(Vertex u, Vertex v) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
is_maximal_element(Vertex u) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
is_maximal_root_oriented(void) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
is_minimal_element(Vertex u) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
is_parent(Vertex u, Vertex v) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
maximal_elements_begin() constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
maximal_elements_end() constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
Maximal_elements_iterator typedefT_Directed_acyclic_graph< VertexProperty, EdgeProperty >
MAXIMAL_ROOT_ORIENTATION enum valueT_Directed_acyclic_graph< VertexProperty, EdgeProperty >
minimal_elements_begin() constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
minimal_elements_end() constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
Minimal_elements_iterator typedefT_Directed_acyclic_graph< VertexProperty, EdgeProperty >
MINIMAL_ROOT_ORIENTATION enum valueT_Directed_acyclic_graph< VertexProperty, EdgeProperty >
operator[](Vertex v)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
operator[](Vertex v) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
operator[](Edge e)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
operator[](Edge e) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
Orientation_type enum nameT_Directed_acyclic_graph< VertexProperty, EdgeProperty >
parents_begin(Vertex v) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
parents_end(Vertex v) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
Parents_iterator typedefT_Directed_acyclic_graph< VertexProperty, EdgeProperty >
print_in_dot_format(OutputStream &out) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >
print_in_dot_format(void) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >
remove_edge(Vertex u, Vertex v)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
remove_edge(Edge e)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
remove_vertex(Vertex v)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
Self typedefT_Directed_acyclic_graph< VertexProperty, EdgeProperty >
T_Directed_acyclic_graph(Orientation_type orientation=MAXIMAL_ROOT_ORIENTATION)T_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
Vertex typedefT_Directed_acyclic_graph< VertexProperty, EdgeProperty >
vertices_begin(void) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
vertices_end(void) constT_Directed_acyclic_graph< VertexProperty, EdgeProperty >inline
Vertices_iterator typedefT_Directed_acyclic_graph< VertexProperty, EdgeProperty >