topsort Member List

This is the complete list of members for topsort, 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 &G, edge &e, node &n)dfs [inline, virtual]
begin() const dfs [inline]
calc_comp_num(bool set)dfs
calc_comp_num() const dfs [inline]
check(graph &G)topsort [virtual]
comp_num(const node &n) const dfs [inline]
dfs()dfs
dfs_iterator typedefdfs
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 valuealgorithm
GTL_OK enum valuealgorithm
init_handler(graph &G)topsort [virtual]
is_acyclic() const topsort [inline]
leave_handler(graph &, node &, node &)topsort [virtual]
new_start_handler(graph &G, node &n)dfs [inline, virtual]
non_tree_edges_begin() const dfs [inline]
non_tree_edges_end() const dfs [inline]
non_tree_edges_iterator typedefdfs
number_of_reached_nodes() const dfs [inline]
old_adj_node_handler(graph &, edge &, node &)topsort [virtual]
operator[](const node &n) const dfs [inline]
reached(const node &n) const dfs [inline]
reset()topsort [virtual]
roots_begin() const dfs [inline]
roots_end() const dfs [inline]
roots_iterator typedefdfs
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]
top_num(const node &n) const topsort [inline]
top_order_begin() const topsort [inline]
top_order_end() const topsort [inline]
topsort()topsort [inline]
tree_edges_begin() const dfs [inline]
tree_edges_end() const dfs [inline]
tree_edges_iterator typedefdfs
~algorithm()algorithm [inline, virtual]
~dfs()dfs [virtual]