#include <graph-dry.H>

Inheritance diagram for GraphCommon< GT, Node, Arc >::In_Iterator:

Collaboration diagram for GraphCommon< GT, Node, Arc >::In_Iterator:

Additional Inherited Members
Public Types inherited from GraphCommon< GT, Node, Arc >::Digraph_Iterator< In_Filt >
using	Item_Type = typename Itor::Item_Type

using	Iterator_Type = Itor
	the type of items (Arc*)

Public Member Functions inherited from GraphCommon< GT, Node, Arc >::Digraph_Iterator< In_Filt >
	Digraph_Iterator (Node *p)
	Instantiate an filtered iterator for arcs on the node `p`

void	next_ne () noexcept

void	next ()
	Advance to next arc.

void	prev ()
	back to previous item.

void	prev_ne ()

bool	has_curr () const noexcept
	Return true is the iterator has a current arc.

GT::Arc *	get_curr () const
	Return the current arc.

GT::Arc *	get_curr_ne () const noexcept

auto	get_current_arc () const

auto	get_current_arc_ne () const noexcept

GT::Node *	get_node (typename GT::Arc *a) const noexcept
	Return the node connected to `p` (passed during construction) and linked through `a`

GT::Node *	get_node () const

GT::Node *	get_node_ne () const noexcept
	Return the node connected to `p` (passed during construction) and linked through the current arc.

auto	get_tgt_node_ne () const noexcept
	Backward-compatible alias: return target node (same as `get_node_ne()`).

auto	get_tgt_node () const
	Backward-compatible alias: return target node (same as `get_node()`).

void	reset_first () noexcept
	Reset the iterator to first arc.

void	reset_last () noexcept
	Reset the iterator to last arc.

Detailed Description

template<class GT, class Node, class Arc>
struct GraphCommon< GT, Node, Arc >::In_Iterator

Definition at line 3050 of file graph-dry.H.

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

Additional Inherited Members