 |
Aleph-w
1.9
General library for algorithms and data structures
|
|
|
Aleph-w
1.9
General library for algorithms and data structures
|
|
#include <graph-dry.H>
Inherits Iterator.
Public Types | |
| using | Node = typename GT::Node |
| using | Arc = typename GT::Arc |
| using | Item_Type = Arc * |
| The type of item that returns the iterator. | |
| using | Set_Type = GT |
| The type of container on which iterate. | |
Public Member Functions | |
| GTArcIterator (Dlink &head) noexcept | |
| Build a iterator for all the arcs of g. | |
| Arc * | get_curr_ne () const noexcept |
| Return current arc without exception. | |
| Arc * | get_curr () const |
| Return current arc. | |
| Arc * | get_current_arc () const |
| Return the current arc. | |
| Arc * | get_current_arc_ne () const noexcept |
| Return the current arc without exception. | |
| Node * | get_src_node_ne () const noexcept |
| Return the sourcenode of current arc (if it is a directed graph) | |
| Node * | get_tgt_node_ne () const noexcept |
| Return the target node of current arc (if it is a directed graph) | |
| Node * | get_src_node () const |
| Return the sourcenode of current arc (if it is a directed graph) | |
| Node * | get_tgt_node () const |
| Return the target node of current arc (if it is a directed graph) | |
Common arc iterator for graph having its arcs derived from Dlink class.
This class serves as implementation support for iterador on arcs that are derived for Dlink class. This is currently the case for List_Graph and Array_Graph.