| add_nodes(size_type nr) | WordGraph< Node > | |
| add_to_out_degree(size_type nr) | WordGraph< Node > | |
| adjacency_matrix_type typedef | WordGraph< Node > | |
| apply_row_permutation(S const &p) (defined in WordGraph< Node >) | WordGraph< Node > | inlineprotected |
| cbegin_nodes() const noexcept | WordGraph< Node > | inline |
| cbegin_targets(node_type source) const | WordGraph< Node > | |
| cbegin_targets_no_checks(node_type source) const noexcept | WordGraph< Node > | inline |
| cend_nodes() const noexcept | WordGraph< Node > | inline |
| cend_targets(node_type source) const | WordGraph< Node > | |
| cend_targets_no_checks(node_type source) const noexcept | WordGraph< Node > | inline |
| const_iterator_nodes typedef | WordGraph< Node > | |
| const_iterator_targets typedef | WordGraph< Node > | |
| const_reverse_iterator_nodes typedef | WordGraph< Node > | |
| disjoint_union_inplace(WordGraph< Node > const &that) | WordGraph< Node > | |
| disjoint_union_inplace_no_checks(WordGraph< Node > const &that) | WordGraph< Node > | |
| hash_value() const | WordGraph< Node > | inline |
| induced_subgraph(node_type first, node_type last) | WordGraph< Node > | |
| induced_subgraph(Iterator first, Iterator last) | WordGraph< Node > | |
| induced_subgraph_no_checks(node_type first, node_type last) | WordGraph< Node > | |
| induced_subgraph_no_checks(Iterator first, Iterator last) | WordGraph< Node > | |
| init(size_type m=0, size_type n=0) | WordGraph< Node > | |
| init(WordGraph< OtherNode > const &that) | WordGraph< Node > | |
| label_type typedef | WordGraph< Node > | |
| labels() const noexcept | WordGraph< Node > | inline |
| labels_and_targets(node_type source) const | WordGraph< Node > | |
| labels_and_targets_no_checks(node_type source) const noexcept | WordGraph< Node > | inline |
| next_label_and_target(node_type s, label_type a) const | WordGraph< Node > | |
| next_label_and_target_no_checks(node_type s, label_type a) const | WordGraph< Node > | |
| node_type typedef | WordGraph< Node > | |
| nodes() const noexcept | WordGraph< Node > | inline |
| number_of_edges() const | WordGraph< Node > | |
| number_of_edges(node_type s) const | WordGraph< Node > | |
| number_of_edges_no_checks(node_type s) const | WordGraph< Node > | |
| number_of_nodes() const noexcept | WordGraph< Node > | inline |
| operator!=(WordGraph const &that) const | WordGraph< Node > | inline |
| operator<(WordGraph const &that) const | WordGraph< Node > | inline |
| operator<=(WordGraph const &that) const | WordGraph< Node > | inline |
| operator=(WordGraph const &) | WordGraph< Node > | |
| operator=(WordGraph &&) | WordGraph< Node > | |
| operator==(WordGraph const &that) const | WordGraph< Node > | inline |
| operator>(WordGraph const &that) const | WordGraph< Node > | inline |
| operator>=(WordGraph const &that) const | WordGraph< Node > | inline |
| out_degree() const noexcept | WordGraph< Node > | inline |
| random(size_type number_of_nodes, size_type out_degree, std::mt19937 mt=std::mt19937(std::random_device()())) | WordGraph< Node > | static |
| remove_all_targets() | WordGraph< Node > | inline |
| remove_label(label_type a) | WordGraph< Node > | |
| remove_label_no_checks(label_type a) | WordGraph< Node > | |
| remove_target(node_type s, label_type a) | WordGraph< Node > | |
| remove_target_no_checks(node_type s, label_type a) | WordGraph< Node > | inline |
| reserve(size_type m, size_type n) | WordGraph< Node > | |
| size_type typedef | WordGraph< Node > | |
| swap_targets(node_type m, node_type n, label_type a) | WordGraph< Node > | |
| swap_targets_no_checks(node_type m, node_type n, label_type a) | WordGraph< Node > | inline |
| target(node_type s, label_type a, node_type t) | WordGraph< Node > | |
| target(node_type source, label_type a) const | WordGraph< Node > | |
| target_no_checks(node_type s, label_type a, node_type t) | WordGraph< Node > | inline |
| target_no_checks(node_type s, label_type a) const | WordGraph< Node > | inline |
| targets(node_type source) const | WordGraph< Node > | |
| targets_no_checks(node_type source) const noexcept | WordGraph< Node > | inline |
| WordGraph(size_type m=0, size_type n=0) | WordGraph< Node > | explicit |
| WordGraph(WordGraph const &) | WordGraph< Node > | |
| WordGraph(WordGraph< OtherNode > const &that) | WordGraph< Node > | |
| WordGraph(WordGraph &&) | WordGraph< Node > | |
