Aleph::Test_Single_Graph< GT, SN, SA > Class Template Reference

Determines whether a graph or digraph is simple. More...

#include <single_graph.H>

Public Member Functions
	Test_Single_Graph (SN &&__sn=SN(), SA &&__sa=SA())
bool	test_node (typename GT::Node *p)
	Returns true if p has neither multi-arcs nor self-loops.
bool	operator() (GT &g)

Private Types
typedef GT::Node	GT_Node

Private Attributes
SN &	sn
SA &	sa

Detailed Description

template<AlephGraph GT, NodeFilter< GT > SN = Dft_Show_Node<GT>, ArcFilter< GT > SA = Dft_Show_Arc<GT>>
class Aleph::Test_Single_Graph< GT, SN, SA >

Determines whether a graph or digraph is simple.

A simple graph is one that has no duplicate arcs.

The class takes three type parameters:

1. GT: the graph
2. SN: filter class for the node iterator.
3. SA: filter class for the arc iterator.

Author

Leandro R. León

Definition at line 63 of file single_graph.H.

Member Typedef Documentation

GT_Node

template<AlephGraph GT, NodeFilter< GT > SN = Dft_Show_Node<GT>, ArcFilter< GT > SA = Dft_Show_Arc<GT>>

typedef GT::Node Aleph::Test_Single_Graph< GT, SN, SA >::GT_Node

private

Definition at line 68 of file single_graph.H.

Constructor & Destructor Documentation

Test_Single_Graph()

template<AlephGraph GT, NodeFilter< GT > SN = Dft_Show_Node<GT>, ArcFilter< GT > SA = Dft_Show_Arc<GT>>

Aleph::Test_Single_Graph< GT, SN, SA >::Test_Single_Graph ( SN &&  __sn = SN(), SA &&  __sa = SA()  )

inline

Definition at line 72 of file single_graph.H.

Member Function Documentation

operator()()

template<AlephGraph GT, NodeFilter< GT > SN = Dft_Show_Node<GT>, ArcFilter< GT > SA = Dft_Show_Arc<GT>>

bool Aleph::Test_Single_Graph< GT, SN, SA >::operator() ( GT &  g )

inline

Definition at line 95 of file single_graph.H.

References Aleph::blossom_maximum_cardinality_matching(), Aleph::Filter_Iterator< Container, It, Show_Item >::next_ne(), Aleph::Test_Single_Graph< GT, SN, SA >::sn, and Aleph::Test_Single_Graph< GT, SN, SA >::test_node().

test_node()

template<AlephGraph GT, NodeFilter< GT > SN = Dft_Show_Node<GT>, ArcFilter< GT > SA = Dft_Show_Arc<GT>>

bool Aleph::Test_Single_Graph< GT, SN, SA >::test_node ( typename GT::Node *  p )

inline

Returns true if p has neither multi-arcs nor self-loops.

Definition at line 79 of file single_graph.H.

References Aleph::Dlink::insert(), Aleph::Filter_Iterator< Container, It, Show_Item >::next_ne(), nodes, and Aleph::Test_Single_Graph< GT, SN, SA >::sa.

Referenced by Aleph::Test_Single_Graph< GT, SN, SA >::operator()().

Member Data Documentation

sa

template<AlephGraph GT, NodeFilter< GT > SN = Dft_Show_Node<GT>, ArcFilter< GT > SA = Dft_Show_Arc<GT>>

SA& Aleph::Test_Single_Graph< GT, SN, SA >::sa

private

Definition at line 66 of file single_graph.H.

Referenced by Aleph::Test_Single_Graph< GT, SN, SA >::test_node().

sn

template<AlephGraph GT, NodeFilter< GT > SN = Dft_Show_Node<GT>, ArcFilter< GT > SA = Dft_Show_Arc<GT>>

SN& Aleph::Test_Single_Graph< GT, SN, SA >::sn

private

Definition at line 65 of file single_graph.H.

Referenced by Aleph::Test_Single_Graph< GT, SN, SA >::operator()().

---

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

• single_graph.H