Aleph::List_SGraph< __Graph_Node, __Graph_Arc >::Node_Iterator Class Reference

Node iterator for a graph. More...

#include <tpl_sgraph.H>

Inheritance diagram for Aleph::List_SGraph< __Graph_Node, __Graph_Arc >::Node_Iterator:

Collaboration diagram for Aleph::List_SGraph< __Graph_Node, __Graph_Arc >::Node_Iterator:

Public Types
using	Item_Type = Node *
	Data type returned by get_curr()
using	Set_Type = List_SGraph
	The set type over which iteration is performed.

Public Member Functions
	Node_Iterator ()=default
	Node_Iterator (const List_SGraph &g) noexcept
Node *	get_current_node () const
	Returns the current node.
Node *	get_current_node_ne () const noexcept

Detailed Description

template<typename __Graph_Node = Graph_Snode<unsigned long>, typename __Graph_Arc = Graph_Sarc<unsigned long>>
class Aleph::List_SGraph< __Graph_Node, __Graph_Arc >::Node_Iterator

Node iterator for a graph.

This class iterates over all nodes of a graph.

Definition at line 321 of file tpl_sgraph.H.

Member Typedef Documentation

Item_Type

template<typename __Graph_Node = Graph_Snode<unsigned long>, typename __Graph_Arc = Graph_Sarc<unsigned long>>

using Aleph::List_SGraph< __Graph_Node, __Graph_Arc >::Node_Iterator::Item_Type = Node *

Data type returned by get_curr()

Definition at line 325 of file tpl_sgraph.H.

Set_Type

template<typename __Graph_Node = Graph_Snode<unsigned long>, typename __Graph_Arc = Graph_Sarc<unsigned long>>

using Aleph::List_SGraph< __Graph_Node, __Graph_Arc >::Node_Iterator::Set_Type = List_SGraph

The set type over which iteration is performed.

Definition at line 328 of file tpl_sgraph.H.

Constructor & Destructor Documentation

Node_Iterator() [1/2]

template<typename __Graph_Node = Graph_Snode<unsigned long>, typename __Graph_Arc = Graph_Sarc<unsigned long>>

Aleph::List_SGraph< __Graph_Node, __Graph_Arc >::Node_Iterator::Node_Iterator ( )

default

Node_Iterator() [2/2]

template<typename __Graph_Node = Graph_Snode<unsigned long>, typename __Graph_Arc = Graph_Sarc<unsigned long>>

Aleph::List_SGraph< __Graph_Node, __Graph_Arc >::Node_Iterator::Node_Iterator ( const List_SGraph &  g )

inlinenoexcept

Definition at line 332 of file tpl_sgraph.H.

Member Function Documentation

get_current_node()

template<typename __Graph_Node = Graph_Snode<unsigned long>, typename __Graph_Arc = Graph_Sarc<unsigned long>>

Node * Aleph::List_SGraph< __Graph_Node, __Graph_Arc >::Node_Iterator::get_current_node ( ) const

inline

Returns the current node.

Definition at line 339 of file tpl_sgraph.H.

References Aleph::get_curr().

get_current_node_ne()

template<typename __Graph_Node = Graph_Snode<unsigned long>, typename __Graph_Arc = Graph_Sarc<unsigned long>>

Node * Aleph::List_SGraph< __Graph_Node, __Graph_Arc >::Node_Iterator::get_current_node_ne ( ) const

inlinenoexcept

Definition at line 344 of file tpl_sgraph.H.

References Aleph::get_curr_ne().

---

The documentation for this class was generated from the following file:

• tpl_sgraph.H