 |
Aleph-w
1.9
General library for algorithms and data structures
|
|
|
Aleph-w
1.9
General library for algorithms and data structures
|
|
This is the complete list of members for GraphCommon< GT, Node, Arc >, including all inherited members.
| all_arcs(Operation &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| all_arcs(Operation &&op=Operation()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| all_arcs(Node *p, Operation &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| all_arcs(Node *p, Operation &&op=Operation()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| all_in_arcs(Node *p, Op &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| all_in_arcs(Node *p, Op &&op=Op()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| all_nodes(Operation &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| all_nodes(Operation &&op=Operation()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| all_out_arcs(Node *p, Op &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| all_out_arcs(Node *p, Op &&op=Op()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| Arc_Type typedef (defined in GraphCommon< GT, Node, Arc >) | GraphCommon< GT, Node, Arc > | |
| ArcPair typedef | GraphCommon< GT, Node, Arc > | |
| arcs() const | GraphCommon< GT, Node, Arc > | inline |
| arcs(Node *p) const | GraphCommon< GT, Node, Arc > | inline |
| arcs_map(std::function< T(Arc *)> operation) const | GraphCommon< GT, Node, Arc > | inline |
| arcs_map(Node *p, std::function< T(Arc *)> operation) const | GraphCommon< GT, Node, Arc > | inline |
| common_swap(GT &g) noexcept (defined in GraphCommon< GT, Node, Arc >) | GraphCommon< GT, Node, Arc > | inlineprotected |
| cookie (defined in GraphCommon< GT, Node, Arc >) | GraphCommon< GT, Node, Arc > | protected |
| degree(Node *p) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| digraph (defined in GraphCommon< GT, Node, Arc >) | GraphCommon< GT, Node, Arc > | protected |
| emplace_arc(Node *src, Node *tgt, Args &&... args) | GraphCommon< GT, Node, Arc > | inline |
| emplace_node(Args &&... args) | GraphCommon< GT, Node, Arc > | inline |
| esize() const noexcept | GraphCommon< GT, Node, Arc > | inline |
| exists_arc(Operation &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| exists_arc(Operation &&op=Operation()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| exists_arc(Node *p, Operation &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| exists_arc(Node *p, Operation &&op=Operation()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| exists_in_arc(Node *p, Op &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| exists_in_arc(Node *p, Op &&op=Op()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| exists_node(Operation &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| exists_node(Operation &&op=Operation()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| exists_out_arc(Node *p, Op &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| exists_out_arc(Node *p, Op &&op=Op()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| filter_arcs(Op &op) const | GraphCommon< GT, Node, Arc > | inline |
| filter_arcs(Op &&op) const | GraphCommon< GT, Node, Arc > | inline |
| filter_arcs(Node *p, Op &op) const | GraphCommon< GT, Node, Arc > | inline |
| filter_arcs(Node *p, Op &&op) const | GraphCommon< GT, Node, Arc > | inline |
| filter_in_arcs(Node *p, Op &op) const | GraphCommon< GT, Node, Arc > | inline |
| filter_in_arcs(Node *p, Op &&op=Op()) const | GraphCommon< GT, Node, Arc > | inline |
| Filter_Iterator typedef | GraphCommon< GT, Node, Arc > | |
| filter_nodes(Op &op) const | GraphCommon< GT, Node, Arc > | inline |
| filter_nodes(Op &&op) const | GraphCommon< GT, Node, Arc > | inline |
| filter_out_arcs(Node *p, Op &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| filter_out_arcs(Node *p, Op &&op=Op()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| find_arc(const Arc_Type &info) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| find_node(const Node_Type &info) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| foldl_arcs(const T &init, std::function< T(const T &, Arc *)> op) const | GraphCommon< GT, Node, Arc > | inline |
| foldl_arcs(Node *p, const T &init, std::function< T(const T &, Arc *)> op) const | GraphCommon< GT, Node, Arc > | inline |
| foldl_in_arcs(Node *p, const T &init, std::function< T(const T &, Arc *)> op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| foldl_nodes(const T &init, std::function< T(const T &, Node *)> op) const | GraphCommon< GT, Node, Arc > | inline |
| foldl_out_arcs(Node *p, const T &init, std::function< T(const T &, Arc *)> op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| for_each_arc(Operation &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| for_each_arc(Operation &&operation=Operation()) const | GraphCommon< GT, Node, Arc > | inline |
| for_each_arc(Node *p, Operation &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| for_each_arc(Node *p, Operation &&op=Operation()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| for_each_arc(Node *p, Operation &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| for_each_in_arc(Node *p, Op &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| for_each_in_arc(Node *p, Op &&op=Op()) const noexcept(noexcept(op)) (defined in GraphCommon< GT, Node, Arc >) | GraphCommon< GT, Node, Arc > | inline |
| for_each_node(Operation &operation) const noexcept(noexcept(operation)) | GraphCommon< GT, Node, Arc > | inline |
| for_each_node(Operation &&operation=Operation()) const | GraphCommon< GT, Node, Arc > | inline |
| for_each_out_arc(Node *p, Op &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| for_each_out_arc(Node *p, Op &&op=Op()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| get_arc() const | GraphCommon< GT, Node, Arc > | inline |
| get_arc(Node *p) | GraphCommon< GT, Node, Arc > | inline |
| get_arc_it() const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_arc_it(Node *p) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_bit(Node *node, int bit) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_bit(Arc *arc, int bit) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_connected_node(Arc *arc, Node *node) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_control_bits(Node *node) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_control_bits(Arc *arc) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_cookie() noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_cookie() const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_cookie(Node *node) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_cookie(Arc *arc) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_counter(Node *node) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_counter(Arc *arc) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_in_it(Node *p) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_node() const | GraphCommon< GT, Node, Arc > | inline |
| get_node_it() const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_num_arcs() const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_num_arcs(Node *node) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_num_nodes() const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_out_it(Node *p) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_src_node(Arc *arc) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| get_tgt_node(Arc *arc) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| in_arcs(Node *p) const | GraphCommon< GT, Node, Arc > | inline |
| in_arcs_map(Node *p, std::function< T(Arc *)> op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| in_degree(Node *p) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| In_Iterator typedef | GraphCommon< GT, Node, Arc > | |
| in_nodes(Node *p) const | GraphCommon< GT, Node, Arc > | inline |
| in_pairs(Node *p) const | GraphCommon< GT, Node, Arc > | inline |
| init() noexcept (defined in GraphCommon< GT, Node, Arc >) | GraphCommon< GT, Node, Arc > | inlineprotected |
| insert_arc(Node *src, Node *tgt, const Arc_Type &arc_info) | GraphCommon< GT, Node, Arc > | inline |
| insert_arc(Node *src, Node *tgt, Arc_Type &&arc_info=Arc_Type()) | GraphCommon< GT, Node, Arc > | inline |
| insert_node(const Node_Type &node_info) | GraphCommon< GT, Node, Arc > | inline |
| insert_node(Node_Type &&node_info=Node_Type()) | GraphCommon< GT, Node, Arc > | inline |
| is_digraph() const noexcept | GraphCommon< GT, Node, Arc > | inline |
| map_arcs(A1 *p, A2 *q) noexcept | GraphCommon< GT, Node, Arc > | inlinestatic |
| map_nodes(N1 *p, N2 *q) noexcept | GraphCommon< GT, Node, Arc > | inlinestatic |
| Node_Type typedef (defined in GraphCommon< GT, Node, Arc >) | GraphCommon< GT, Node, Arc > | |
| nodes() const | GraphCommon< GT, Node, Arc > | inline |
| nodes_map(std::function< T(Node *)> op) const | GraphCommon< GT, Node, Arc > | inline |
| num_arcs (defined in GraphCommon< GT, Node, Arc >) | GraphCommon< GT, Node, Arc > | protected |
| num_nodes (defined in GraphCommon< GT, Node, Arc >) | GraphCommon< GT, Node, Arc > | protected |
| out_arcs(Node *p) const | GraphCommon< GT, Node, Arc > | inline |
| out_arcs_map(Node *p, std::function< T(Arc *)> op) const | GraphCommon< GT, Node, Arc > | inline |
| out_degree(Node *p) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| Out_Iterator typedef | GraphCommon< GT, Node, Arc > | |
| out_nodes(Node *p) const | GraphCommon< GT, Node, Arc > | inline |
| out_pairs(Node *p) const | GraphCommon< GT, Node, Arc > | inline |
| reset_arc(Arc *arc) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_arc_counters() const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_arcs() const | GraphCommon< GT, Node, Arc > | inline |
| reset_bit(Node *node, int bit) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_bit(Arc *arc, int bit) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_bit_arcs(int bit) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_bit_arcs() const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_bit_nodes(int bit) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_bit_nodes() const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_bits(Node *node) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_bits(Arc *arc) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_cookie_arcs() const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_cookie_nodes() const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_counter(Node *node) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_counter(Arc *arc) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_counter_arcs() const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_counter_nodes() const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_node(Node *p) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_node_counters() const noexcept | GraphCommon< GT, Node, Arc > | inline |
| reset_nodes() const | GraphCommon< GT, Node, Arc > | inline |
| search_arc(Op &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| search_arc(Op &&op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| search_arc(Node *p, Operation &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| search_arc(Node *p, Operation &&op=Operation()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| search_arc(Node *src, Node *tgt) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| search_directed_arc(Node *src, Node *tgt) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| search_in_arc(Node *p, Op &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| search_in_arc(Node *p, Op &&op=Op()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| search_node(Op &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| search_node(Op &&op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| search_out_arc(Node *p, Op &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| search_out_arc(Node *p, Op &&op=Op()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| set_bit(Node *node, int bit, int value) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| set_bit(Arc *arc, int bit, int value) const noexcept | GraphCommon< GT, Node, Arc > | inline |
| set_digraph(bool val) | GraphCommon< GT, Node, Arc > | inline |
| traverse_arcs(Operation &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| traverse_arcs(Operation &&op=Operation()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| traverse_arcs(Node *p, Operation &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| traverse_arcs(Node *p, Operation &&op=Operation()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| traverse_arcs(Node *p, Operation &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| traverse_in_arcs(Node *p, Op &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| traverse_in_arcs(Node *p, Op &&op=Op()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| traverse_nodes(Operation &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| traverse_nodes(Operation &&op=Operation()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| traverse_out_arcs(Node *p, Op &op) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| traverse_out_arcs(Node *p, Op &&op=Op()) const noexcept(noexcept(op)) | GraphCommon< GT, Node, Arc > | inline |
| vsize() const noexcept | GraphCommon< GT, Node, Arc > | inline |