|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <tpl_agraph.H>
Public Types | |
| using | Base = GTNodeIterator< Array_Graph > |
Public Types inherited from GTNodeIterator< Array_Graph > | |
| using | Node = typename GT::Node |
| using | Item_Type = Node * |
| The type of item that returns the iterator. | |
| using | Set_Type = Array_Graph |
| The type of container on which iterate. | |
Public Member Functions | |
| Node_Iterator (const Array_Graph &g) noexcept | |
Public Member Functions inherited from GTNodeIterator< Array_Graph > | |
| GTNodeIterator () noexcept | |
| GTNodeIterator (Dlink &head) noexcept | |
| Build a iterator for all the nodes of g. | |
| Node * | get_curr_ne () const noexcept |
| Return the current node without exception. | |
| Node * | get_curr () const |
| Return the current node. | |
| Node * | get_current_node () const |
| Return the current node. | |
| Node * | get_current_node_ne () const |
Definition at line 305 of file tpl_agraph.H.
| using Aleph::Array_Graph< __Graph_Node, __Graph_Arc >::Node_Iterator::Base = GTNodeIterator<Array_Graph> |
Definition at line 307 of file tpl_agraph.H.
|
inlinenoexcept |
Definition at line 310 of file tpl_agraph.H.