Home | Documentation | Download | Platforms | Projects | Mailing Lists | Version History

- Main Page
- Classes
- Files
- Related Pages

- Alphabetical List
- Class List
- Class Hierarchy
- Class Members

# components Member List

This is the complete list of members for components, including all inherited members.

after_recursive_call_handler(graph &G, edge &e, node &n) | dfs | `[inline, virtual]`
algorithm() | algorithm | `[inline]`
before_recursive_call_handler(graph &, edge &, node &) | components | `[virtual]`
begin() const | dfs | `[inline]`
calc_comp_num(bool set) | dfs |
calc_comp_num() const | dfs | `[inline]`
check(graph &G) | components | `[virtual]`
comp_num(const node &n) const | dfs | `[inline]`
components() | components |
components_begin() | components | `[inline]`
components_end() | components | `[inline]`
dfs() | dfs |
dfs_iterator typedef | dfs |
dfs_num(const node &n) const | dfs | `[inline]`
end() const | dfs | `[inline]`
end_handler(graph &G) | dfs | `[inline, virtual]`
entry_handler(graph &G, node &n, node &f) | dfs | `[inline, virtual]`
father(const node &n) const | dfs | `[inline]`
GTL_ERROR enum value | algorithm |
GTL_OK enum value | algorithm |
init_handler(graph &G) | dfs | `[inline, virtual]`
leave_handler(graph &G, node &n, node &f) | dfs | `[inline, virtual]`
new_start_handler(graph &, node &) | components | `[virtual]`
non_tree_edges_begin() const | dfs | `[inline]`
non_tree_edges_end() const | dfs | `[inline]`
non_tree_edges_iterator typedef | dfs |
number_of_components() const | components | `[inline]`
number_of_reached_nodes() const | dfs | `[inline]`
old_adj_node_handler(graph &, edge &, node &) | components | `[virtual]`
operator[](const node &n) const | dfs | `[inline]`
reached(const node &n) const | dfs | `[inline]`
reset() | components | `[virtual]`
roots_begin() const | dfs | `[inline]`
roots_end() const | dfs | `[inline]`
roots_iterator typedef | dfs |
run(graph &G) | dfs | `[virtual]`
scan_whole_graph(bool set) | dfs | `[inline]`
scan_whole_graph() const | dfs | `[inline]`
start_node(const node &n) | dfs | `[inline]`
start_node() const | dfs | `[inline]`
store_non_tree_edges(bool set) | dfs |
store_non_tree_edges() const | dfs | `[inline]`
store_preds(bool set) | dfs |
store_preds() const | dfs | `[inline]`
tree_edges_begin() const | dfs | `[inline]`
tree_edges_end() const | dfs | `[inline]`
tree_edges_iterator typedef | dfs |
~algorithm() | algorithm | `[inline, virtual]`
~components() | components | `[inline, virtual]`
~dfs() | dfs | `[virtual]`

University of Passau - FMI - Theoretical Computer Science

Design © 2002, 2003 Marcus Raitner, University of Passau