DGtal 0.3.0
Data Structures | Namespaces | Defines

CAdjacency.h File Reference

#include <iostream>
#include <vector>
#include "boost/concept_check.hpp"
#include "DGtal/utils/ConceptUtils.h"
#include "DGtal/base/Common.h"
#include "DGtal/topology/CAdjacency.ih"
Include dependency graph for CAdjacency.h:

Go to the source code of this file.

Data Structures

struct  DGtal::CAdjacency< Adj >
 Aim: The concept CAdjacency defines an elementary adjacency relation between points of a digital space. More...


namespace  DGtal


#define CAdjacency_RECURSES
#define CAdjacency_h

Detailed Description

This program is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program. If not, see <http://www.gnu.org/licenses/>.

Jacques-Olivier Lachaud (jacques-olivier.lachaud@univ-savoie.fr ) Laboratory of Mathematics (CNRS, UMR 5807), University of Savoie, France

Header file for concept CAdjacency.cpp

This file is part of the DGtal library.

Definition in file CAdjacency.h.

Define Documentation

#define CAdjacency_h

Prevents repeated inclusion of headers.

Definition at line 39 of file CAdjacency.h.

#define CAdjacency_RECURSES

Prevents recursive inclusion of headers.

Definition at line 35 of file CAdjacency.h.

 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines