bfs Member List

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

act_bfs_numbfs [protected]
algorithm()algorithm [inline]
begin() const bfs [inline]
bfs()bfs
bfs_iterator typedefbfs
bfs_num(const node &n) const bfs [inline]
bfs_numberbfs [protected]
bfs_orderbfs [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 valuealgorithm
GTL_OK enum valuealgorithm
init_handler(graph &G)bfs [inline, virtual]
level(const node &n) const bfs [inline]
level_numberbfs [protected]
new_start_handler(graph &G, node &n)bfs [inline, virtual]
non_treebfs [protected]
non_tree_edges_begin() const bfs [inline]
non_tree_edges_end() const bfs [inline]
non_tree_edges_iterator typedefbfs
number_of_reached_nodes() const bfs [inline]
operator[](const node &n) const bfs [inline]
popped_node_handler(graph &G, node &n)bfs [inline, virtual]
predsbfs [protected]
qubfs [protected]
reached(const node &n) const bfs [inline]
reached_nodesbfs [protected]
reset()bfs [virtual]
rootsbfs [protected]
roots_begin() const bfs [inline]
roots_end() const bfs [inline]
roots_iterator typedefbfs
run(graph &G)bfs [virtual]
scan_whole_graph(bool set)bfs [inline]
scan_whole_graph() const bfs [inline]
startbfs [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]
treebfs [protected]
tree_edges_begin() const bfs [inline]
tree_edges_end() const bfs [inline]
tree_edges_iterator typedefbfs
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_graphbfs [protected]
~algorithm()algorithm [inline, virtual]
~bfs()bfs [virtual]