CGraphVisitor.h

 
#pragma once

 
#if defined(CGraphVisitor_RECURSES)
#error Recursive header files inclusion detected in CGraphVisitor.h
#else // defined(CGraphVisitor_RECURSES)
#define CGraphVisitor_RECURSES
 
#if !defined CGraphVisitor_h
#define CGraphVisitor_h

// Inclusions
#include <iostream>
#include "boost/tuple/tuple.hpp"
#include "DGtal/base/Common.h"
#include "DGtal/graph/CVertexPredicate.h"
#include "DGtal/graph/CVertexPredicateArchetype.h"
#include "DGtal/graph/CUndirectedSimpleLocalGraph.h"
 
// @since 0.8 In DGtal::concepts
namespace DGtal {
  namespace concepts {

// class CGraphVisitor
template <typename T>
struct CGraphVisitor : boost::CopyConstructible<T>
{
  // ----------------------- Concept checks ------------------------------
public:
  // 1. define first provided types (i.e. inner types), like
  typedef typename T::Graph Graph;
  typedef typename T::Vertex Vertex;
  typedef typename T::Size Size;
  typedef typename T::Data Data;
  typedef typename T::MarkSet MarkSet;
  typedef typename T::Node Node;
  typedef CVertexPredicateArchetype<Vertex> VertexPredicate;
 
  BOOST_CONCEPT_ASSERT(( CUndirectedSimpleLocalGraph< Graph > ));
  BOOST_STATIC_ASSERT(( ConceptUtils::SameType<Vertex, typename Graph::Vertex>::value ));
  BOOST_STATIC_ASSERT(( ConceptUtils::SameType<Size, typename Graph::Size>::value ));
  BOOST_CONCEPT_ASSERT(( boost::SimpleAssociativeContainer< MarkSet > ));
  BOOST_CONCEPT_ASSERT(( boost::UniqueAssociativeContainer< MarkSet > ));
  BOOST_STATIC_ASSERT(( ConceptUtils::SameType<Vertex, typename MarkSet::key_type>::value ));
  BOOST_CONCEPT_ASSERT(( boost::DefaultConstructible< Data > ));
  BOOST_CONCEPT_ASSERT(( boost::Assignable< Data > ));
  BOOST_CONCEPT_ASSERT(( boost::CopyConstructible< Data > ));
  BOOST_STATIC_ASSERT(( boost::is_convertible<Node, std::pair<Vertex,Data> >::value ));
 
  // To test if two types A and Y are equals, use
  // 2. then check the presence of data members, operators and methods with
  BOOST_CONCEPT_USAGE( CGraphVisitor )
  {
    // check non-const methods.
    myX.expand();
    myX.expand( myVPred );
    myX.ignore();
    myX.terminate();
    // check const methods.
    checkConstConstraints();
  }
  void checkConstConstraints() const
  {
    ConceptUtils::sameType( myGraph, myX.graph() );
    ConceptUtils::sameType( myNode, myX.current() );
    ConceptUtils::sameType( myBool, myX.finished() );
    ConceptUtils::sameType( myMarkSet, myX.markedVertices() );
    ConceptUtils::sameType( myMarkSet, myX.visitedVertices() );
  }
  // ------------------------- Private Data --------------------------------
private:
  T myX; // do not require T to be default constructible.
  Graph myGraph;
  Node myNode;
  bool myBool;
  VertexPredicate myVPred;
  MarkSet myMarkSet;
 
}; // end of concept CGraphVisitor
 
} // namespace concepts
} // namespace DGtal
 
//                                                                           //
 
#endif // !defined CGraphVisitor_h
 
#undef CGraphVisitor_RECURSES
#endif // else defined(CGraphVisitor_RECURSES)