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

- Main Page
- Classes
- Files
- Related Pages

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

# bfs Member List

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

act_bfs_num | bfs | `[protected]`
algorithm() | algorithm | `[inline]`
begin() const | bfs | `[inline]`
bfs() | bfs |
bfs_iterator typedef | bfs |
bfs_num(const node &n) const | bfs | `[inline]`
bfs_number | bfs | `[protected]`
bfs_order | bfs | `[protected]`
calc_level(bool set) | bfs |
calc_level() const | bfs | `[inline]`
check(graph &G) | bfs | `[inline, virtual]`
end() const | bfs | `[inline]`
end_handler(graph &G) | bfs | `[inline, virtual]`
father(const node &n) const | bfs | `[inline]`
finished_node_handler(graph &G, node &n) | bfs | `[inline, virtual]`
GTL_ERROR enum value | algorithm |
GTL_OK enum value | algorithm |
init_handler(graph &G) | bfs | `[inline, virtual]`
level(const node &n) const | bfs | `[inline]`
level_number | bfs | `[protected]`
new_start_handler(graph &G, node &n) | bfs | `[inline, virtual]`
non_tree | bfs | `[protected]`
non_tree_edges_begin() const | bfs | `[inline]`
non_tree_edges_end() const | bfs | `[inline]`
non_tree_edges_iterator typedef | bfs |
number_of_reached_nodes() const | bfs | `[inline]`
operator[](const node &n) const | bfs | `[inline]`
popped_node_handler(graph &G, node &n) | bfs | `[inline, virtual]`
preds | bfs | `[protected]`
qu | bfs | `[protected]`
reached(const node &n) const | bfs | `[inline]`
reached_nodes | bfs | `[protected]`
reset() | bfs | `[virtual]`
roots | bfs | `[protected]`
roots_begin() const | bfs | `[inline]`
roots_end() const | bfs | `[inline]`
roots_iterator typedef | bfs |
run(graph &G) | bfs | `[virtual]`
scan_whole_graph(bool set) | bfs | `[inline]`
scan_whole_graph() const | bfs | `[inline]`
start | bfs | `[protected]`
start_node(const node &n) | bfs | `[inline]`
start_node() const | bfs | `[inline]`
store_non_tree_edges(bool set) | bfs |
store_non_tree_edges() const | bfs | `[inline]`
store_preds(bool set) | bfs |
store_preds() const | bfs | `[inline]`
tree | bfs | `[protected]`
tree_edges_begin() const | bfs | `[inline]`
tree_edges_end() const | bfs | `[inline]`
tree_edges_iterator typedef | bfs |
unused_node_handler(graph &G, node &n, node &f) | bfs | `[inline, virtual]`
used_node_handler(graph &G, node &n, node &f) | bfs | `[inline, virtual]`
whole_graph | bfs | `[protected]`
~algorithm() | algorithm | `[inline, virtual]`
~bfs() | bfs | `[virtual]`

University of Passau - FMI - Theoretical Computer Science

Design © 2002, 2003 Marcus Raitner, University of Passau