|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Node iterator. More...
#include <tpl_graph.H>
Public Types | |
| using | Base = GTNodeIterator< List_Graph > |
Public Types inherited from GTNodeIterator< List_Graph > | |
| using | Node = typename GT::Node |
| using | Item_Type = Node * |
| The type of item that returns the iterator. | |
| using | Set_Type = List_Graph |
| The type of container on which iterate. | |
Public Member Functions | |
| Node_Iterator (const List_Graph &g) | |
Construct an iterator on the nodes of g | |
Public Member Functions inherited from GTNodeIterator< List_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 |
Node iterator.
This is an iterator on all the nodes of graph.
Definition at line 794 of file tpl_graph.H.
| using Aleph::List_Graph< _Graph_Node, _Graph_Arc >::Node_Iterator::Base = GTNodeIterator<List_Graph> |
Definition at line 796 of file tpl_graph.H.
|
inline |
Construct an iterator on the nodes of g
Definition at line 799 of file tpl_graph.H.