|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Common arc iterator for graph having its arcs derived from Dlink class. More...
#include <graph-dry.H>
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 () noexcept | |
| 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 source node 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 source node 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.
Definition at line 300 of file graph-dry.H.
| using GTArcIterator< GT >::Arc = typename GT::Arc |
Definition at line 303 of file graph-dry.H.
| using GTArcIterator< GT >::Item_Type = Arc * |
The type of item that returns the iterator.
Definition at line 306 of file graph-dry.H.
| using GTArcIterator< GT >::Node = typename GT::Node |
Definition at line 302 of file graph-dry.H.
| using GTArcIterator< GT >::Set_Type = GT |
The type of container on which iterate.
Definition at line 309 of file graph-dry.H.
|
inlinenoexcept |
Definition at line 311 of file graph-dry.H.
|
inlinenoexcept |
Build a iterator for all the arcs of g.
Definition at line 316 of file graph-dry.H.
|
inline |
Return current arc.
Definition at line 328 of file graph-dry.H.
Referenced by GTArcIterator< GT >::get_current_arc(), GTArcIterator< GT >::get_src_node(), and GTArcIterator< GT >::get_tgt_node().
|
inlinenoexcept |
Return current arc without exception.
Definition at line 322 of file graph-dry.H.
Referenced by GTArcIterator< GT >::get_current_arc_ne(), GTArcIterator< GT >::get_src_node_ne(), and GTArcIterator< GT >::get_tgt_node_ne().
|
inline |
Return the current arc.
Definition at line 331 of file graph-dry.H.
References GTArcIterator< GT >::get_curr().
|
inlinenoexcept |
Return the current arc without exception.
Definition at line 334 of file graph-dry.H.
References GTArcIterator< GT >::get_curr_ne().
|
inline |
Return the source node of current arc (if it is a directed graph)
Definition at line 349 of file graph-dry.H.
References GTArcIterator< GT >::get_curr().
|
inlinenoexcept |
Return the source node of current arc (if it is a directed graph)
Definition at line 337 of file graph-dry.H.
References GTArcIterator< GT >::get_curr_ne().
|
inline |
Return the target node of current arc (if it is a directed graph)
Definition at line 355 of file graph-dry.H.
References GTArcIterator< GT >::get_curr().
|
inlinenoexcept |
Return the target node of current arc (if it is a directed graph)
Definition at line 343 of file graph-dry.H.
References GTArcIterator< GT >::get_curr_ne().