#include <graph-dry.H>

Public Member Functions
	In_Filt (Node *__tgt=nullptr) noexcept
	target node of iteration More...

bool	operator() (Arc *a) const noexcept

Node *	get_node (Arc *a) const noexcept
	Return the source node of arc `a`

Public Attributes
Node *	tgt = nullptr

Detailed Description

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

Filter for input arcs of a node.

This class is intended to be used in a arc iterator for only shwoing the input arcs.

When an arc is created, the source and target nodes are specified. For example:

auto a = g.insert_arc(s, t)

creates an arc linking the nodes s and t. If g is a directed graph, then the notion of source and target has much sense. This sense in esential. In this case $s \longrightarrow t \ neq t \longrightarrow s$ . The classes List_Digraph, List_SDigraph and Array_Digraph were conceived for explicit modeling of directed graphs.

However, sometimes is very useful to consider the sense $s \longrightarrow t$ i graph classes that do not explicitely model the sense. The In_Filt filter used in combination with a filter iterator on arcs, is used for filtering arcs whose target is the node on the which one is iterating.

This class in intensively used in Aleph-w ( $\aleph_\omega$ ) network flows, which, in order to directly have the residual net, use non-directed graphs instead of directed ones.

Normally you must not worry by the existence of this class. It is transparently used by the class In_Iterator

Constructor & Destructor Documentation

◆ In_Filt()

template<class GT, class Node, class Arc>

GraphCommon< GT, Node, Arc >::In_Filt::In_Filt ( Node * __tgt = nullptr )

inlinenoexcept

target node of iteration

Buld a filter on input arcs to arc __tgt

Member Function Documentation

◆ operator()()

template<class GT, class Node, class Arc>

bool GraphCommon< GT, Node, Arc >::In_Filt::operator() ( Arc * a ) const

inlinenoexcept

Return true if the arc a is incoming arc to tgt; false otherwise

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

graph-dry.H

Public Member Functions