GTNodeIterator< GT > Struct Template Reference

#include <graph-dry.H>

Inherits Iterator.

Public Types
using	Node = typename GT::Node
using	Item_Type = Node *
	The type of item that returns the iterator.
using	Set_Type = GT
	The type of container on which iterate.

Public Member Functions
	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

Detailed Description

template<class GT>
struct GTNodeIterator< GT >

Common node iterator for graph having its node derived from Dlink class.

This class serves as implementation support for iterador on nodes that are derived for Dlink class. This is currently the case for List_Graph and Array_Graph.

---

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

• graph-dry.H