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

Determina si un grafo o digrafo es 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)
	retorna true si p no tiene multiarcos ni lazos
bool	operator() (GT &g)

Private Types
typedef GT::Node	GT_Node

Private Attributes
SN &	sn
SA &	sa

Detailed Description

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

Determina si un grafo o digrafo es simple.

Un grafo simple es uno que notiene arcos repetidos.

La clase recibe tres parámetros tipo:

1. GT: el grafo
2. SN: clase filtro para el iterador de nodos.
3. SA: clase filtro para el iterador de arcos.

Author

Leandro R. León

Definition at line 61 of file single_graph.H.

Member Typedef Documentation

GT_Node

template<class GT , class SN = Dft_Show_Node<GT>, class SA = Dft_Show_Arc<GT>>

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

private

Definition at line 66 of file single_graph.H.

Constructor & Destructor Documentation

Test_Single_Graph()

template<class GT , class SN = Dft_Show_Node<GT>, class 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 70 of file single_graph.H.

Member Function Documentation

operator()()

template<class GT , class SN = Dft_Show_Node<GT>, class SA = Dft_Show_Arc<GT>>

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

inline

Definition at line 93 of file single_graph.H.

References Aleph::maps(), 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<class GT , class SN = Dft_Show_Node<GT>, class SA = Dft_Show_Arc<GT>>

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

inline

retorna true si p no tiene multiarcos ni lazos

Definition at line 77 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<class GT , class SN = Dft_Show_Node<GT>, class SA = Dft_Show_Arc<GT>>

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

private

Definition at line 64 of file single_graph.H.

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

sn

template<class GT , class SN = Dft_Show_Node<GT>, class SA = Dft_Show_Arc<GT>>

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

private

Definition at line 63 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