Aleph::List_Graph< __Graph_Node, __Graph_Arc >::Node_Iterator Struct Reference

#include <tpl_graph.H>

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

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

Public Types
using	Base = GTNodeIterator< List_Graph >
using	Node = typename List_Graph ::Node
using	Item_Type = Node *
	The type of item that returns the iterator.
using	Set_Type = List_Graph
	The type of container on which iterate.

Public Member Functions
	Node_Iterator (const List_Graph &g)
	Construct an iterator on 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<typename __Graph_Node = Graph_Node<unsigned long>, typename __Graph_Arc = Graph_Arc<unsigned long>>
struct Aleph::List_Graph< __Graph_Node, __Graph_Arc >::Node_Iterator

Node iterator

This is an iterator on all the nodes of graph.

---

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

• tpl_graph.H