| add_edge(node_indext a, node_indext b) | grapht< xml_graph_nodet > | inline |
| add_node(arguments &&... values) | grapht< xml_graph_nodet > | inline |
| add_node_if_not_exists(std::string node_name) | graphmlt | inline |
| add_undirected_edge(node_indext a, node_indext b) | grapht< xml_graph_nodet > | |
| clear() | grapht< xml_graph_nodet > | inline |
| connected_subgraphs(std::vector< node_indext > &subgraph_nr) | grapht< xml_graph_nodet > | |
| depth_limited_search(typename N::node_indext src, std::size_t limit) const | grapht< xml_graph_nodet > | |
| depth_limited_search(std::vector< typename N::node_indext > &src, std::size_t limit) const | grapht< xml_graph_nodet > | |
| depth_limited_search(std::vector< typename N::node_indext > &src, std::size_t limit, std::vector< bool > &visited) const | grapht< xml_graph_nodet > | protected |
| disconnect_unreachable(node_indext src) | grapht< xml_graph_nodet > | |
| disconnect_unreachable(const std::vector< node_indext > &src) | grapht< xml_graph_nodet > | |
| edge(node_indext a, node_indext b) | grapht< xml_graph_nodet > | inline |
| edgest typedef | grapht< xml_graph_nodet > | |
| edget typedef | grapht< xml_graph_nodet > | |
| empty() const | grapht< xml_graph_nodet > | inline |
| for_each_predecessor(const node_indext &n, std::function< void(const node_indext &)> f) const | grapht< xml_graph_nodet > | |
| for_each_successor(const node_indext &n, std::function< void(const node_indext &)> f) const | grapht< xml_graph_nodet > | |
| get_predecessors(const node_indext &n) const | grapht< xml_graph_nodet > | |
| get_reachable(node_indext src, bool forwards) const | grapht< xml_graph_nodet > | |
| get_reachable(const std::vector< node_indext > &src, bool forwards) const | grapht< xml_graph_nodet > | |
| get_successors(const node_indext &n) const | grapht< xml_graph_nodet > | |
| has_edge(node_indext i, node_indext j) const | grapht< xml_graph_nodet > | inline |
| has_node(const std::string &node_name) const | graphmlt | inline |
| in(node_indext n) const | grapht< xml_graph_nodet > | inline |
| is_dag() const | grapht< xml_graph_nodet > | inline |
| key_values | graphmlt | |
| key_valuest typedef | graphmlt | |
| make_chordal() | grapht< xml_graph_nodet > | |
| node_indext typedef | grapht< xml_graph_nodet > | |
| nodes | grapht< xml_graph_nodet > | protected |
| nodest typedef | grapht< xml_graph_nodet > | |
| nodet typedef | grapht< xml_graph_nodet > | |
| operator[](node_indext n) const | grapht< xml_graph_nodet > | inline |
| operator[](node_indext n) | grapht< xml_graph_nodet > | inline |
| out(node_indext n) const | grapht< xml_graph_nodet > | inline |
| output_dot(std::ostream &out) const | grapht< xml_graph_nodet > | |
| patht typedef | grapht< xml_graph_nodet > | |
| remove_edge(node_indext a, node_indext b) | grapht< xml_graph_nodet > | inline |
| remove_edges(node_indext n) | grapht< xml_graph_nodet > | inline |
| remove_in_edges(node_indext n) | grapht< xml_graph_nodet > | |
| remove_out_edges(node_indext n) | grapht< xml_graph_nodet > | |
| remove_undirected_edge(node_indext a, node_indext b) | grapht< xml_graph_nodet > | |
| resize(node_indext s) | grapht< xml_graph_nodet > | inline |
| SCCs(std::vector< node_indext > &subgraph_nr) const | grapht< xml_graph_nodet > | |
| shortest_loop(node_indext node, patht &path) const | grapht< xml_graph_nodet > | inline |
| shortest_path(node_indext src, node_indext dest, patht &path) const | grapht< xml_graph_nodet > | inline |
| shortest_path(node_indext src, node_indext dest, patht &path, bool non_trivial) const | grapht< xml_graph_nodet > | protected |
| size() const | grapht< xml_graph_nodet > | inline |
| swap(grapht &other) | grapht< xml_graph_nodet > | inline |
| tarjan(class tarjant &t, node_indext v) const | grapht< xml_graph_nodet > | protected |
| topsort() const | grapht< xml_graph_nodet > | |
| visit_reachable(node_indext src) | grapht< xml_graph_nodet > | |
1.9.1