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

#include <tpl_sgraph.H>

Inherits Aleph::DynSetTree< Key, Tree, Compare >::Iterator.

Public Types
using	Item_Type = Node *
	Tipo de elemento que retorna get_curr()
using	Set_Type = List_SGraph
	El tipo de conjunto sobre el cual se itera.
using	Base = typename Tree_Type::Iterator

Public Member Functions
	Node_Iterator (const List_SGraph &g) noexcept
Node *	get_current_node () const
	retorna el nodo actual.
Node *	get_current_node_ne () const noexcept
const Key &	get_curr_ne () const noexcept
Key &	get_curr_ne () noexcept
const Key &	get_curr () const
Key &	get_curr ()

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

Iterador de nodos de un grafo.

Esta clase itera sobre todos los nodos de un grafo.

---

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

• tpl_sgraph.H