Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Out_Iterator_AllArcs< GT, SA > Class Template Reference
Inheritance diagram for Out_Iterator_AllArcs< GT, SA >:
[legend]
Collaboration diagram for Out_Iterator_AllArcs< GT, SA >:
[legend]

Public Types

using Base = Out_Iterator< GT, SA >
 
- Public Types inherited from Aleph::Out_Iterator< GT, Show_Arc >
using Item_Type = typename GT::Arc *
 
- Public Types inherited from Aleph::Digraph_Iterator< GT, __Out_Filt< GT > >
using Item_Type = typename Itor::Item_Type
 
using Iterator_Type = Itor
 The type of element.
 

Public Member Functions

GT::Arcget_current_arc_ne () const noexcept
 
- Public Member Functions inherited from Aleph::Out_Iterator< GT, Show_Arc >
 Out_Iterator ()=default
 
 Out_Iterator (typename GT::Node *p, Show_Arc sa=Show_Arc())
 
void next ()
 
void next_ne () noexcept
 
- Public Member Functions inherited from Aleph::Digraph_Iterator< GT, __Out_Filt< GT > >
 Digraph_Iterator (typename GT::Node *p)
 Iterator type.
 
void next ()
 Move the iterator one position forward.
 
void next_ne () noexcept
 
void prev ()
 Move the iterator one position backward.
 
bool has_curr () const noexcept
 Return true the iterator has an current arc.
 
GT::Arcget_curr () const
 Return the current arc.
 
GT::Arcget_curr_ne () const noexcept
 Return the current arc.
 
auto get_current_arc () const
 This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. Alias for get_curr().
 
GT::Nodeget_node (typename GT::Arc *a) const noexcept
 Return the connected node to arc.
 
GT::Nodeget_node () const
 Return the connected node to current arc.
 
auto get_tgt_node () const
 This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. Alias for get_node().
 
GT::Nodeget_node_ne () const noexcept
 Return the connected node to current arc.
 
auto get_tgt_node_ne () const noexcept
 This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. Alias for get_node_ne().
 
void reset_first () noexcept
 Reset the iterator to the first arc.
 
void reset_last () noexcept
 Reset the iterator to the last arc.
 
void end () noexcept
 Put the iterator in end state.
 

Detailed Description

template<class GT, class SA = Dft_Show_Arc<GT>>
class Out_Iterator_AllArcs< GT, SA >

Definition at line 23 of file test_dijkstra.cc.

Member Typedef Documentation

◆ Base

template<class GT , class SA = Dft_Show_Arc<GT>>
using Out_Iterator_AllArcs< GT, SA >::Base = Out_Iterator<GT, SA>

Definition at line 26 of file test_dijkstra.cc.

Member Function Documentation

◆ get_current_arc_ne()

template<class GT , class SA = Dft_Show_Arc<GT>>
GT::Arc * Out_Iterator_AllArcs< GT, SA >::get_current_arc_ne ( ) const
inlinenoexcept

The documentation for this class was generated from the following file: