Aleph-w  1.9
General library for algorithms and data structures
GraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter > Member List

This is the complete list of members for GraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >, including all inherited members.

Digraph_Iterator(Node *p) noexcept(noexcept(Filter(p)) and noexcept(Itor(p, filt)))GraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >inline
get_curr() constGraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >inline
get_curr_ne() const noexcept (defined in GraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >)GraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >inline
get_current_arc() constGraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >inline
get_current_arc_ne() const noexcept (defined in GraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >)GraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >inline
get_node(typename GT::Arc *a) const noexceptGraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >inline
get_node() const (defined in GraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >)GraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >inline
get_node_ne() const noexceptGraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >inline
get_tgt_node() constGraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >inline
get_tgt_node_ne() const noexceptGraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >inline
has_curr() const noexceptGraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >inline
Item_Type typedef (defined in GraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >)GraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >
Iterator_Type typedefGraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >
next()GraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >inline
next_ne() noexcept (defined in GraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >)GraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >inline
prev()GraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >inline
prev_ne() (defined in GraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >)GraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >inline
reset_first() noexceptGraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >inline
reset_last() noexceptGraphCommon< GT, Node, Arc >::Digraph_Iterator< Filter >inline

Leandro Rabindranath León