DAG.h

Go to the documentation of this file.

/***************************************************************************
 *   Copyright (C) 2005 by Christophe GONZALES and Pierre-Henri WUILLEMIN  *
 *   {prenom.nom}_at_lip6.fr                                               *
 *                                                                         *
 *   This program is free software; you can redistribute it and/or modify  *
 *   it under the terms of the GNU General Public License as published by  *
 *   the Free Software Foundation; either version 2 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, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *
 ***************************************************************************/
#ifndef GUM_DAG_H
#define GUM_DAG_H

#include <agrum/graphs/undiGraph.h>
#include <agrum/graphs/diGraph.h>

namespace gum {

  /* ====================================================================== */
  /* ===      BASE CLASS FOR MANIPULATING GRAPHS WITH BOTH EDGES AND ARCS     */
  /* ====================================================================== */
  /* ====================================================================== */
  class DAG : public DiGraph {
    public:
    // ############################################################################
    // ############################################################################


    explicit DAG(Size nodes_size = HashTableConst::default_size,
                 bool nodes_resize_policy = true,
                 Size arcs_size = HashTableConst::default_size,
                 bool arcs_resize_policy = true);


    DAG(const DAG& g);

    virtual ~DAG();


    // ############################################################################
    // ############################################################################


    DAG& operator=(const DAG& g);


    // ############################################################################
    // ############################################################################


    virtual void addArc(const NodeId tail, const NodeId head);

    UndiGraph moralGraph() const;

    private:
    bool __hasDirectedPath(const NodeId from, const NodeId to);
  };

} /* namespace gum */

#ifndef GUM_NO_INLINE
#  include <agrum/graphs/DAG_inl.h>
#endif   // GUM_NOINLINE

#endif /* GUM_DAG_H */