graph.h

Go to the documentation of this file.

/* -*- mode: c++; c-basic-offset: 3 -*-
 *
 * Copyright (c), GREYC.
 * All rights reserved
 *
 * You may use this file under the terms of the BSD license as follows:
 *
 * "Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met:
 *   * Redistributions of source code must retain the above copyright
 *     notice, this list of conditions and the following disclaimer.
 *   * Redistributions in binary form must reproduce the above copyright
 *     notice, this list of conditions and the following disclaimer in
 *     the documentation and/or other materials provided with the
 *     distribution.
 *   * Neither the name of the GREYC, nor the name of its
 *     contributors may be used to endorse or promote products
 *     derived from this software without specific prior written
 *     permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
 *
 *
 * For more information, refer to:
 * https://clouard.users.greyc.fr/Pandore
 */

#include <vector>

#ifndef __PGRAPHH__
#define __PGRAPHH__

namespace pandore {
   
   class Graph2d;
   class Graph3d;
   
   
   /* @brief Trait that returns the name of the Pandore type.
    *
    * TypeName is a trait that returns the name
    * of the Pandore type T.
    */
   template<>
   struct TypeName< Graph2d > {
         static std::string Name() { return "Graph2d"; }
   };
   
   
   /* @brief Trait that returns the name of the Pandore type.
    *
    * TypeName is a trait that returns the name
    * of the Pandore type T.
    */
   template<> struct TypeName< Graph3d > {
         static std::string Name() { return "Graph3d"; }
   };
   
   class GEdge {
      private:
         
         GEdge *next; 
         
         Long node;
         
         Long item;
         
      public:
         Double weight;
         
         GEdge( Long n, GEdge *adj, Double w = 1 ): next(adj), node(n), item(-1), weight(w) {}
         
         GEdge( Long n, GEdge *adj, Long i, Double w = 1 ): next(adj), node(n), item(i), weight(w) {}
         
         ~GEdge() { }
         
         Long Node() const { return node; };
         
         GEdge* Next() const { return next; };
         
         GEdge* Next( GEdge* n ) {
            return next = n;
         }
         
         Long Item() const {
            return item;
         }
         
         Long Item( Long i ) {
            return item = i;
         }
   };
   
   template< class Point >
   class GNode {
      private:
         GEdge *adjacents;
         Long item;
         std::vector<GEdge *> etrash;
         
      public :
         Double value;
         Point seed;
         
         GNode( Long i ): adjacents(0), item(i), value(255.0) { }

         GNode( Long i, const Point p ): adjacents(0), item(i), value(255.0), seed(p) { }
         
         ~GNode();
         
         GEdge* Neighbours() const {
            return adjacents;
         }
         
         GEdge* Search( Long n ) const ;
         
         GEdge* Search( Long n, Long i ) const ;
         
         GEdge* Add( Long n, Double w );
         
         GEdge* Add( Long n, Long i, Double w );
         
         GEdge* Del( Long n );
         
         GEdge* Del( Long n, Long i );
         
         Long Item() const {
            return item;
         }
         
         Long Item( Long i ) {
            return item = i;
         }
   };
   
   /*
    * No GRAPH1D: it is not useful... It's my opinion.
    */
   
   class Graph2d: public Pobject {
      private :
         GNode< Point2d > **tnode;
         Long size;
         Long ncol;
         Long nrow;
         bool _directed;
         
         friend class GEdge;
         
      public :
         
         typedef Double ValueType;
         
         Typobj Type() const { return Po_Graph2d; }
         
         std::string Name() const { return TypeName< Graph2d >::Name(); }
         
         bool isDirected() const {
            return _directed;
         }
         
         Long Width() const {
            return ncol;
         }
         
         Long Height() const {
            return nrow;
         }
         
         Long Size() const {
            return size;
         }
         
         Dimension2d ImageSize() const {
            return Dimension2d(nrow, ncol);
         }
         
         PobjectProps Props() const {
            return PobjectProps(0, ncol, nrow, 0, (PColorSpace)0, 0, size, _directed);
         }
         
         Graph2d( bool directed = false): tnode(0), size(0), ncol(0), nrow(0), _directed(directed) { }
         
         Graph2d( Long s, bool directed = false ): tnode(0), size(0), _directed(directed) {
            New(s, 0, 0);
         }
         
         Graph2d( Long s, Long h, Long w, bool directed = false ): tnode(0), size(0), _directed(directed) {
            New(s, h, w);
         }
         
         Graph2d( Long s, const Dimension2d &d, bool directed = false ): tnode(0), size(0), _directed(directed) {
            New(s, d.h, d.w);
         }
         
         Graph2d( const PobjectProps &p ): tnode(0), size(0) {
            _directed = p.directed;
            New(p.size, p.nrow, p.ncol);
         }
         
         ~Graph2d() { 
            Delete(); 
         }
         
         void New( Long s, Long h, Long w );
         
         void New( const PobjectProps &p ) {
            New(p.size, p.nrow, p.ncol);
         }
         
         void Delete();
         
         Graph2d& operator=( const Graph2d &src );
         
         Errc Init( const Reg2d& rgs, const Reg2d& seeds );
         
         Errc Init( const Reg2d &rgs );
         
         Pobject *Clone() const;
         
         GNode<Point2d> *operator[]( Long pos ) {
            return tnode[pos];
         }
         
         const GNode<Point2d> *operator[]( Long pos ) const {
            return tnode[pos];
         }
         
         Errc Add( Long node, Long item, const Point2d &pt );
         
         Errc Add( Long node, Long item ) {
            return Add(node, item, Point2d(0, 0));
         }
         
         Errc Add( Long node, Long item, Long y, Long x ) {
            return Add(node, item, Point2d(y, x));
         }
         
         Errc Del( Long s );
         
         Errc Link( Long s1, Long s2, Double weight = 1.0F, bool add = false );
         
         Errc Link( Long s1, Long s2, Long i, Double weight = 1.0F, bool add = false );
         
         Errc Unlink( Long s1, Long s2 );
         
         Errc Unlink( Long s1, Long s2, Long i );
         
         Errc Merge( Long s1, Long s2 );
         
         Errc Split( Long s1, Long s2 );
         
         Errc LoadAttributes( FILE *file );
         
         Errc SaveAttributes( FILE *file ) const;
         
         Errc LoadData( FILE *file );
         
         Errc SaveData( FILE *file ) const;
         
         Pobject *Mask( const Pobject *mask ) ;
         
         Pobject *UnMask( const Pobject *mask, const Pobject *reference ) ;
         
         Graph2d( const Graph2d &grs ): Pobject() {
            *this = grs;
            _directed = grs._directed;
         }
   };
   
   class Graph3d: public Pobject {
      private :
         GNode<Point3d> **tnode;
         Long size;
         Long ncol;
         Long nrow;
         Long ndep;
         bool _directed;
         
         friend class GEdge;
         
      public :
         
         typedef Double ValueType;
         
         Typobj Type() const { return Po_Graph3d; }
         
         std::string Name() const { return TypeName< Graph3d >::Name(); }
         
         bool isDirected() const {
            return _directed;
         }
         
         Long Width() const { 
            return ncol;
         }
         
         Long Height() const { 
            return nrow; 
         }
         
         Long Depth() const { 
            return ndep;
         }
         
         Long Size() const {
            return size;
         }
         
         Dimension3d ImageSize() const {
            return Dimension3d(ndep, nrow, ncol);
         }
         
         PobjectProps Props() const {
            return PobjectProps(0, ncol, nrow, ndep, (PColorSpace)0, 0, size, _directed); 
         }
         
         Graph3d( bool directed = false ): tnode(0), size(0), ncol(0), nrow(0), ndep(0), _directed(directed) {
         }
         
         Graph3d( Long s, bool directed = false ): tnode(0), size(0), _directed(directed) {
            New(s, 0, 0, 0);
         }
         
         Graph3d( Long s, Long d, Long h, Long w, bool directed = false ): tnode(0), size(0), _directed(directed) {
            New(s, d, h, w);
         }
         
         Graph3d( Long s, const Dimension3d &d, bool directed = false ): tnode(0), size(0), _directed(directed) {
            New(s, d.d, d.h, d.w);
         }
         
         Graph3d( const PobjectProps& p ): tnode(0), size(0) {
            _directed = p.directed;
            New(p.size, p.ndep, p.nrow, p.ncol);
         }
         
         ~Graph3d() {
            Delete();
         }
         
         void New( Long s, Long d, Long h, Long w );
         
         void New( const PobjectProps &p ) {
            New(p.size, p.ndep, p.nrow, p.ncol);
         }
         
         void Delete();
         
         Errc Init( const Reg3d &rgs, const Reg3d &seeds );
         
         Errc Init( const Reg3d &rgs );
         
         Graph3d& operator=( const Graph3d &src );
         
         Pobject *Clone() const;
         
         GNode<Point3d> *operator[]( Long pos ) {
            return tnode[pos];
         }
         
         const GNode<Point3d> *operator[]( Long pos ) const {
            return tnode[pos];
         }
         
         Errc Add( Long node, Long item, const Point3d& pt );
         
         Errc Add( Long node, Long item ) {
            return Add(node, item, Point3d(0, 0, 0));
         }
         
         Errc Add( Long node, Long item, Long z, Long y, Long x ) {
            return Add(node, item, Point3d(z, y, x));
         }
         
         Errc Del( Long s );
         
         Errc Link( Long s1, Long s2, Double weight = 1.0F, bool add = false );
         
         Errc Link( Long s1, Long s2, Long i, Double weight = 1.0F, bool add = false );
         
         Errc Unlink( Long s1, Long s2 );
         
         Errc Unlink( Long s1, Long s2, Long i );
         
         Errc Merge( Long s1, Long s2 );
         
         Errc Split( Long s1, Long s2 );
         
         Errc LoadAttributes( FILE *file );
         
         Errc SaveAttributes( FILE *file ) const;
         
         Errc LoadData( FILE *file );
         
         Errc SaveData( FILE *file ) const;
         
         Pobject *Mask( const Pobject *mask ) ;
         
         Pobject *UnMask( const Pobject *mask, const Pobject *reference ) ;
         
         Graph3d( const Graph3d &grs ): Pobject() {
            _directed = grs._directed;
            *this = grs;
         }
   };
   
} //End of pandore:: namespace

#endif // __PGRAPHH__

---

The Pantheon project
Image Team GREYC Laboratory
UMR CNRS 6072 - ENSICAEN - University of Caen, France
This page was last modified on 19 June 2015