|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Iterator over arcs of a graph. More...
#include <tpl_agraph.H>
Public Types | |
| using | Base = GTArcIterator< Array_Graph > |
Public Types inherited from GTArcIterator< Array_Graph > | |
| 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 = Array_Graph |
| The type of container on which iterate. | |
Public Member Functions | |
| Arc_Iterator (const Array_Graph &g) | |
Public Member Functions inherited from GTArcIterator< Array_Graph > | |
| 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) | |
Iterator over arcs of a graph.
This iterator traverses each arc of the graph. The visit order can be altered if the arcs are previously sorted.
Definition at line 324 of file tpl_agraph.H.
| using Aleph::Array_Graph< __Graph_Node, __Graph_Arc >::Arc_Iterator::Base = GTArcIterator<Array_Graph> |
Definition at line 326 of file tpl_agraph.H.
|
inline |
Definition at line 329 of file tpl_agraph.H.