CUndirectedSimpleGraph.h

#pragma once

#if defined(CUndirectedSimpleGraph_RECURSES)
#error Recursive header files inclusion detected in CUndirectedSimpleGraph.h
#else // defined(CUndirectedSimpleGraph_RECURSES)

#define CUndirectedSimpleGraph_RECURSES

#if !defined CUndirectedSimpleGraph_h

#define CUndirectedSimpleGraph_h

// Inclusions
#include <iostream>
#include "DGtal/base/Common.h"
#include "DGtal/base/CConstSinglePassRange.h"
#include "DGtal/topology/CUndirectedSimpleLocalGraph.h"

namespace DGtal
{

  // class CUndirectedSimpleGraph
  template <typename T> 
  struct CUndirectedSimpleGraph : 
    CUndirectedSimpleLocalGraph<T>, 
    CConstSinglePassRange<T>
  // Use derivation for coarser concepts, like
  // : CoarserConcept<T>
  // Think to boost::CopyConstructible<T>, boost::DefaultConstructible<T>, ...
  // http://www.boost.org/doc/libs/1_49_0/libs/concept_check/reference.htm
  {
    // ----------------------- Concept checks ------------------------------
  public:
    // 1. define first provided types (i.e. inner types), like
    typedef typename T::Edge Edge;
    typedef typename T::Size Size;

    // 2. then check the presence of data members, operators and methods with
    BOOST_CONCEPT_USAGE( CUndirectedSimpleGraph )
    {
      // check const methods.
      checkConstConstraints();
    }
    void checkConstConstraints() const
    {
      ConceptUtils::sameType( mySize, myX.size() );
    }

    // ------------------------- Private Datas --------------------------------
  private:
    T myX; // do not require T to be default constructible.
    Size mySize;
    
    // ------------------------- Internals ------------------------------------
  private:
    
  }; // end of concept CUndirectedSimpleGraph
  
} // namespace DGtal

//                                                                           //

#endif // !defined CUndirectedSimpleGraph_h

#undef CUndirectedSimpleGraph_RECURSES
#endif // else defined(CUndirectedSimpleGraph_RECURSES)